It is supposed to do this:
input:
3
4
1 1 1 1
5
8 7 1 3 4
1
5
output:
NO
YES
YES
my code:
https://mirror.codeforces.com/contest/1742/submission/203843549
can you send me the correct code?
# | 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 | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
It is supposed to do this:
input:
3
4
1 1 1 1
5
8 7 1 3 4
1
5
output:
NO
YES
YES
my code:
https://mirror.codeforces.com/contest/1742/submission/203843549
can you send me the correct code?
Name |
---|
You can find tutorial on this link.
If $$$n = 1$$$, the answer is obviously
YES
. Otherwise, you just need to sort the array in any order (ascending or descending) and loop from0
ton-1
, check if there existsa[i] = a[i+1]
, then the answer isNO
, because $$$a_1 < a_2 < ... < a_n$$$ cannot be hold if there exist two equal elements. In other word, the answer isYES
if and only if all elements in array are unique.