Max Amount

Trouble Summary

In Max sum issues , Two buddies A and B are playing with a selection of integers. They both set the operations to be executed on the range but differ on choice of home window size to do the stated operations.

The operations to be done on the array are clarified below:

· One can select to add at one of the most X consecutive components.

· After executing the enhancement operation, it is obligatory to miss the following aspect in the array.

· The objective is to attain maximum amount by picking appropriate components in the selection.

A desires X to be W, while B desires X to be (W + D). This is the only distinction that they have. Your task is to figure out that wins. Victor is the person whose amount is greater.

The inputs that will certainly be offered are worths of aspects of range, worth of W and worth of D.

Instance:

Variety: 4 5 6 1 2 7 8 9

Home Window Size (W): 3

Output: 39

Description

· We will certainly pick to add aspects 4, 5, 6 because window dimension is 3

· Given that one enhancement operation is full, we have to skip one component which is 1

· We select to avoid aspect 2 since the next 3 worths are additionally more than 2

· The max amount therefore obtained is 39

Now mean the variety was: 4 5 6 1 2 3 7 8 9

· We will certainly choose to add components 4, 5, 6 since home window size is 3

· Given that one addition operation is full, we need to miss one component which is 1

· Currently we pick to select element 2 since we can avoid component 3 and still pick up the following 3 worths viz 7, 8, 9

· The max sum hence gotten is 41

· Keep in mind that we grabbed just one component in second choice considering that restraint is only on maximum number to be chosen, not minimum.

Now expect the range was: 4 5 6 7

· Given that one can start from any kind of index, we choose aspect 5, 6, 7

· The max amount therefore acquired is 18

The above instances show the game with a repaired home window dimension of W. Because B favors to play the same game with the size of W+D, the steps will certainly stay the same but limit amount outcome may be various. Print different output relying on whether A success, B victories or it’s a connection.

Restrictions

0

5

– 10 ^ 5

0

0

Input

Initial line contains 3 space separated integers N and W and D specifically, which denote

N– dimension of selection

W– home window dimension

D– distinction

2nd line has of N space apart integers representing the elements of the array

Output

If B success, print “Right

If A success, print “Wrong

If It’s a tie, print “Both are Right”

Refer Instances section for much better understanding.

Time Limit

1

Examples

Example 1

Input

8 5 – 2

4 5 6 1 2 7 8 9

Outcome

Wrong 2

Explanation

Right here we have offered N = 8, W = 5, D = – 2

A will certainly make the most of the amount of aspects of the array using window dimension 5 Whereas B will make best use of the sum of elements of the range making use of home window dimension 3 (5 -2

Using logic as illustrated over A will obtain limit amount as 41 and B will certainly obtain the max sum as 39 The outright distinction is 41– 39 = 2

For this reason, result will certainly be: Wrong 2

Example 2

Input

9 2 2

4 5 6 1 2 3 7 8 9

Outcome

Right 10

Description

Here we have actually provided N = 9, W = 2, D = 2

A will take full advantage of the amount of components of the variety utilizing window size 2 Whereas B will certainly take full advantage of the amount of aspects of the selection making use of home window size 4 (2 +2

Using reasoning as shown above A will obtain limit sum as 33 and B will certainly obtain the max amount as 43 The absolute distinction is 43– 33 = 10

Therefore, result will be: Right 10

Instance 3

Input

10 9 – 3

4 5 6 3 2 3 7 8 9 2

Result

Both are right

Explanation

Right here we have actually given N = 10, W = 9, D = – 3

A will certainly make best use of the amount of elements of the selection making use of window size 9 Whereas B will make the most of the amount of components of the selection using home window dimension 6 (9 -3

Using reasoning as shown over A will certainly obtain the max amount as 47 and B will certainly obtain limit amount as 47 The absolute distinction is 47– 47 = 0.

Hence, output will certainly be: Both are appropriate

[sociallocker id=”766″] [/sociallocker]

You may additionally like: Grooving Monkeys issue