Can someone help me understand the meaning of error message that I am getting here
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Can someone help me understand the meaning of error message that I am getting here
Name |
---|
this means that in jurys answer h[i]<=h[i+1] is 446 times and in your answer its 445 times.
maybe you haven't read the statement well.. the difficulty of the problem means number of element is not less then it's previous adjacent element(count of ar[i]<=ar[i+1]).. and you have to print the array such that the difference between 1st and last element is minimum and the difficulty is maximum.... so in your solution your difficulty count was not the maximum..