K-Subarrays solution codechef

K-Subarrays solution codechef

You are given two integers NN and KK, and an array AA of NN integers. You have to choose KK disjoint non-empty subarrays such that the score is maximized.

The score is calculated as follows:

Score=i=1KSum[i]i,Score=∑i=1KSum[i]⋅i,

where Sum[i]Sum[i] denotes sum of elements of ii-th subarray. By the ii-th subarray, we mean the ii-th one in the order from left to right.

Find the maximum score that can be achieved.

Note: The subarrays are not required to cover the whole array. It is allowed for some elements of AA to belong to none of the subarrays.

Input K-Subarrays solution codechef

  • The first line of the input contains a single integer TT denoting the number of test cases. The description of TT test cases follows.
  • The first line of each test case contains two space-separated integers NN and KK.
  • The second line of each test case contains NN space-separated integers A1,A2,,ANA1,A2,…,AN.

Output K-Subarrays solution codechef

For each test case, print a single line containing one integer ― the maximum score.

Constraints K-Subarrays solution codechef

  • 1T10001≤T≤1000
  • 1N1051≤N≤105
  • 1Kmin(100,N)1≤K≤min(100,N)
  • 106Ai106−106≤Ai≤106
  • The sum of NN over all test cases does not exceed 105105

Subtasks K-Subarrays solution codechef

  • Subtask #1 (15 points)K=1K=1
  • Subtask #2 (35 points): K=2K=2
  • Subtask #3 (50 points): Original constraints

Sample Input v K-Subarrays solution codechef

2
5 2
1 2 -1 3 1
5 2
-1 2 11 -23 12

Sample Output K-Subarrays solution codechef

11
37

Explanation

  • Test Case 1: One way to choose 22 disjoint non-empty subarrays is:

S1=[1,2]S1=[1,2] and S2=[3,1]S2=[3,1]

The score is 31+42=113⋅1+4⋅2=11, which is the maximum possible.

  • Test Case 2: One way to choose 22 disjoint non-empty subarrays is:

S1=[2,11]S1=[2,11] and S2=[12]S2=[12]

The score is 131+122=3713⋅1+12⋅2=37, which is the maximum possible.

SOLUTION

Click here


K-Subarrays solution codechef The Maths Lock solution codechef Minimum Adjacent Swaps to Reach the Kth Smallest Number Minimum Interval to Include Each Query

What’s in it for you?

The idea behind these programming contests is that we want you to learn while competing. Also we believe that it is alright to refer to tutorials, books and other materials, learn a concept and then apply the same to solve a problem during a contest. But it is not alright to copy other people’s solutions or seek other people’s help to solve a problem without understanding it.

The dividing line may seem to be thin but it can be captured by the spirit of learning. If whatever you are doing is making you learn while you do so, we tend to believe that it is alright. Our sole intention lies in making our users learn new concepts while competing. However, all the participants are expected to abide to

What’s new in CodeChef?

You may now play with our new groups & LaTex feature on discuss.

  • Please do not discuss strategy, suggestions or tips in the comments during a live contest. Posting questions clarifying the problem statement is ok. If you are unsure, email us at [email protected] .
  • Discussing CodeChef’s problems or any aspect of problem, on any other platform on web, on identification, could lead to disabling of respective account and banning from the community.
  • You can also send in your queries in an email to [email protected]dechef.com, during the contest.
  • You will receive one point for solving a problem (passing all test cases – no partial credit), regardless of the level of difficulty of that problem.
  • Users are ranked according to the most problems solved. Ties will be broken by the total time for each user in ascending order of time.
  • The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submittal of the first accepted run plus 10 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved.
  • You shall not possess more than one account on CodeChef. If you have, then do let us know, so that we can deactivate the insignificant one. If you do not report it and we come to know about it, we may deactivate both the accounts permanently.
  • If anyone is using code from some other source in his submission, he should provide proper attribution. Failing this, it may be considered plagiarism and the submission will be subject to disqualification.
  • The number of submissions that one can make during the contest on a single problem will be limited to 500.
  • Residents of the following countries and territories are not eligible to win cash prizes/laddus/goodies due to legal restrictions: Albania, The Bahamas, Barbados, Botswana, Cambodia, Crimea region of Russia, Cuba, Ghana, Iceland, Iran, Jamaica, Mauritius, Mongolia, Myanmar, Nicaragua, North Korea, Pakistan, Panama, Sudan, Syria, Uganda, Yemen, Zimbabwe.

Note: You can now “Code, Compile, and Run” your codes on our Online IDE.

However, if you are using any other online development environment, make sure that other contestants don’t have access to your code. As a contestant, you are responsible for making sure others don’t access the code that you submit. If you use Ideone, make sure to mark your submission “private” (not secret)”.

CODECHEF 

Also Read : Neenade Naa song lyrics with English Translation

Leave a Comment