QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #235067 | #6636. Longest Strictly Increasing Sequence | jzh# | AC ✓ | 2ms | 3760kb | C++20 | 669b | 2023-11-02 12:45:48 | 2023-11-02 12:45:48 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int n;
int b[MAXN];
bool solve()
{
scanf("%d", &n);
for (int i=1; i<=n; i++) scanf("%d", &b[i]);
for (int i=1; i<n; i++) if (b[i] > b[i+1]) return false;
int lst = 0;
for (int i=1; i<=n; i++) {
if (b[i] == lst) continue;
if (b[i] == lst+1) {lst++; continue;}
return false;
}
puts("YES");
for (int i=1; i<=n; i++) printf("%d ", b[i]);
puts("");
return 1;
}
int main()
{
int ttt;
scanf("%d", &ttt);
while (ttt--) {
if (!solve()) puts("NO");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3760kb
input:
2 6 1 2 3 2 5 7 2 1 2
output:
NO YES 1 2
result:
ok t=2 (2 test cases)
Test #2:
score: 0
Accepted
time: 2ms
memory: 3640kb
input:
3483 5 2 3 5 1 1 2 8 1 10 1 2 3 4 4 5 6 6 6 7 10 1 1 2 2 2 2 3 4 4 5 2 5 8 3 7 10 8 5 4 1 3 3 8 10 1 2 2 2 2 2 2 3 3 3 10 1 1 2 3 4 5 5 5 5 6 9 1 2 3 4 5 5 6 6 7 7 8 8 8 8 9 1 2 5 8 9 8 3 5 10 1 2 3 3 3 3 4 4 4 5 5 7 1 6 4 3 7 5 6 8 6 1 5 5 10 1 2 2 3 4 4 4 4 5 5 3 10 4 5 3 1 5 3 5 2 8 1 2 1 3 7 8 3...
output:
NO NO YES 1 2 3 4 4 5 6 6 6 7 YES 1 1 2 2 2 2 3 4 4 5 NO NO NO YES 1 2 2 2 2 2 2 3 3 3 YES 1 1 2 3 4 5 5 5 5 6 YES 1 2 3 4 5 5 6 6 7 NO NO YES 1 2 3 3 3 3 4 4 4 5 NO NO YES 1 2 2 3 4 4 4 4 5 5 NO NO NO NO NO NO YES 1 1 1 2 2 3 3 4 4 NO NO NO NO NO NO NO YES 1 2 3 3 3 4 4 4 5 5 YES 1 1 2 2 2...
result:
ok t=3483 (3483 test cases)