Hello . Does anyone know how to register for codechef contests ?
For example for the procon 2014 ....
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Hello . Does anyone know how to register for codechef contests ?
For example for the procon 2014 ....
Hello . I have recently seen a question and I want your help ....
We have a sequence of numbers . Each of them is 1 or -1 .
In every second we can choose a contiguous subsequence of them and do
the operation for each of them : a[i] = a[i] * -1
The question is that given the sequence what is the minimum time needed to transform all of the numbers to 1 ?
Example
Input :
6
1 -1 -1 1 -1 1
Output :
2
Название |
---|