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?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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?
| Название |
|---|



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.