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.me/contest/1742/submission/203843549
can you send me the correct code?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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.me/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 from0ton-1, check if there existsa[i] = a[i+1], then the answer isNO, because $$$a_1 \lt a_2 \lt ... \lt a_n$$$ cannot be hold if there exist two equal elements. In other word, the answer isYESif and only if all elements in array are unique.