Hello . Does anyone know how to register for codechef contests ?
For example for the procon 2014 ....
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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
Название |
---|