"someone" Are you serious? This is really rude.

how to solve ARC-E problem? i have idea for 400 points , maintaining a 2D DP perhaps, but no idea how to solve for n < 2e5.. any idea?! I really loved that problem..

My solution to D — Non-decreasing in case someone needs it:

https://arc086.contest.atcoder.jp/submissions/1862381

Here is how it works:

• Find an index of maximum absolute value;

• If an index of maximum absolute value happens to be a positive number, then add this number twice to a first number. Adding twice is needed in case first number is negative. Then add twice first number to second, add twice second to third and so on. By performing operation twice to the following elements, each element became roughly twice as big as previous one. Let's see a few simple examples for intuition:

Input: 10 -9 Operations:

4
1 1
1 1
1 2
1 2

Input array after operations: 40 71

Input: -9 10 Operations:

4
2 1
2 1
1 2
1 2

Input array after operations: 11 32

Input: 0 0 0 0 1

Input array after operations: 2 4 8 16 33

• If index happens to be a negative number, then it's symmetrical case, so we start updates not from beginning of array but from the end. Let's consider this simple example:

Input: 0 0 0 0 -1 Operations:

10
5 5
5 5
5 4
5 4
4 3
4 3
3 2
3 2
2 1
2 1

Input array after operations: -64 -32 -16 -8 -4