QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #134841 | #6636. Longest Strictly Increasing Sequence | salvator_noster# | AC ✓ | 1ms | 3704kb | C++14 | 542b | 2023-08-05 09:14:42 | 2023-08-05 09:14:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int M=1e6+01;
int A[M];
int main(){
int T;
scanf("%d",&T);
for(int cas=1;cas<=T;++cas){
int n;
scanf("%d",&n);
bool fl=1;
for(int i=1;i<=n;++i){
scanf("%d",A+i);
if(A[i]<A[i-1])fl=0;
if(A[i]>A[i-1]+1)fl=0;
}
if(!fl||A[1]!=1){
puts("NO");
}else{
puts("YES");
printf("1 ");
int lst=1;
for(int i=2;i<=n;++i){
if(A[i]==A[i-1]){
printf("1 ");
}else printf("%d ",++lst);
}
puts("");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3704kb
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: 1ms
memory: 3660kb
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 1 5 6 1 1 7 YES 1 1 2 1 1 1 3 4 1 5 NO NO NO YES 1 2 1 1 1 1 1 3 1 1 YES 1 1 2 3 4 5 1 1 1 6 YES 1 2 3 4 5 1 6 1 7 NO NO YES 1 2 3 1 1 1 4 1 1 5 NO NO YES 1 2 1 3 4 1 1 1 5 1 NO NO NO NO NO NO YES 1 1 1 2 1 3 1 4 1 NO NO NO NO NO NO NO YES 1 2 3 1 1 4 1 1 5 1 YES 1 1 2 1 1...
result:
ok t=3483 (3483 test cases)