QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #127565 | #6636. Longest Strictly Increasing Sequence | Paradox | AC ✓ | 12ms | 3636kb | C++20 | 653b | 2023-07-19 19:51:14 | 2023-07-19 19:51:17 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
const int N=1010;
int a[N],f[N],b[N];
int main(){
int t;cin>>t;
while(t--){
int n;cin>>n;
for(int i=1;i<=n;i++) scanf("%d",&b[i]);
bool flag=1;
a[1]=1;
if(b[1]>1) flag=0;
for(int i=2;i<=n;i++){
if(b[i]<b[i-1] || b[i]-1>b[i-1] || b[i]>i) {flag=0;break;}
if(b[i]==b[i-1]) a[i]=a[i-1];
else a[i]=i;
}
if(flag){
cout<<"YES\n";
for(int i=1;i<=n;i++) cout<<a[i]<<" ";cout<<"\n";
}
else cout<<"NO\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3532kb
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: 12ms
memory: 3636kb
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 6 7 7 7 10 YES 1 1 3 3 3 3 7 8 8 10 NO NO NO YES 1 2 2 2 2 2 2 8 8 8 YES 1 1 3 4 5 6 6 6 6 10 YES 1 2 3 4 5 5 7 7 9 NO NO YES 1 2 3 3 3 3 7 7 7 10 NO NO YES 1 2 2 4 5 5 5 5 9 9 NO NO NO NO NO NO YES 1 1 1 4 4 6 6 8 8 NO NO NO NO NO NO NO YES 1 2 3 3 3 6 6 6 9 9 YES 1 1 3...
result:
ok t=3483 (3483 test cases)