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.com/contest/1742/submission/203843549
can you send me the correct code?
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 143 |
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.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.