| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
given a 2d(N*N) matrix...N<=5*10^3 ...maximize F(a,b,c,d)=A[a][b]+A[c][d] -|a-c|-|b-d| ...0<=A[i][j]<=10^9. output max value of F for (a,b) not equal to (c,d) i.e. 2 distinct points. i was only able to think of bruteforce hence TLEd :(
P.S. solved finally
Here is another problem from the same contest which I am unable to figure out:
X and Y are playing a game on a given array with n elements. X removes an element from the array. Y removes the element at the middle position of the remaining array. This game continues till no elements remain. Maximize the elements picked by X. And output the sum of the elements of X.
Constraints:
Input Format
n followed by n spaced integers denoting the n elements of the given array.
Output Format
A single number denoting the maximum sum of elements X can get to
Sample Input 1:
4
1 2 3 4
Sample Output 1:
7
Sample Input 2:
4
5 15 10 5
Sample Output 2:
20
How would you go about solving this?
agc053_b
One of my friend asked me this problem yesterday . Here is a link to my solution to this problem .
Public Test Cases are passing .. And I'm sure it will pass main tests .
PS: Tell me if you want me to explain my approach