| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
An Interesting Problem
Given an Array, find the maximum difference between the sum of elements in odd indices and even indices. To achieve this you can delete any number of elements from the array,after deleting the elements,the array will be re-numbered.
Example : 1 4 8 2 6
Upon deleting 1,2.
New array 8 2 6 Answer is 8+6-2 = 12.
Constraints : 1<=N<=1e5
Can anyone please help me solve this problem?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en4 |
|
AjaySabarish | 2020-07-19 16:09:59 | 0 | (published) | |
| en3 |
|
AjaySabarish | 2020-07-19 16:09:04 | 2 | Tiny change: 'eleting 1,2.\n\nNew a' -> 'eleting 1,4.\n\nNew a' (saved to drafts) | |
| en2 |
|
AjaySabarish | 2020-07-19 16:03:52 | 2 | Tiny change: 'ay 8 2 6\nAnswer i' -> 'ay 8 2 6\n\nAnswer i' | |
| en1 |
|
AjaySabarish | 2020-07-19 16:03:26 | 419 | Initial revision (published) |
