| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | atcoder_official | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
I am not able to figure out the test case for which my code gives the wrong answer. Can anybody help me out on this one. Thanks in advance.
Problem link- https://codeforces.me/contest/1341/problem/C My solution- https://codeforces.me/contest/1341/submission/77847675
while(ind<=pos&&i<=n){ //cout<<i<<" "; if(mp[i]!=ind){ flag=1; break; } i++,ind++; } After the last mp[i] == ind and ind <= pos and i <= n, you will make i + 1. So you will take number, you need. But later you will make one more i + 1. I think problem is here.
UPD: Try to solve this problem with cycle WHILE.
Right, now I understand. Thank you very much.