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://codeforces.net/contest/1742/submission/203843549
can you send me the correct code?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3885 |
3 | jqdai0815 | 3682 |
4 | Benq | 3580 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3506 |
7 | ecnerwala | 3505 |
8 | Radewoosh | 3457 |
9 | Kevin114514 | 3377 |
10 | gamegame | 3374 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | -is-this-fft- | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
8 | awoo | 152 |
10 | maomao90 | 148 |
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://codeforces.net/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.