QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #127443 | #6636. Longest Strictly Increasing Sequence | llb1238 | AC ✓ | 16ms | 3440kb | C++14 | 937b | 2023-07-19 17:42:41 | 2023-07-19 17:42:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int a[1001];
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
bool flag = 1;
int now_maxx = 0;
for(int i=1;i<=n;i++){
if(a[i]>n){
flag = 0;
break;
}
if(a[i]>now_maxx+1){
flag = 0;
break;
}
if(a[i]<now_maxx){
flag = 0;
break;
}
now_maxx = max(now_maxx,a[i]);
}
if(flag){
cout<<"YES"<<endl;
for(int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
cout<<endl;
}
else{
cout<<"NO"<<endl;
}
}
return 0;
}
/*
2
6
1 2 3 2 5 7
2
1 2
*/
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3324kb
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: 16ms
memory: 3440kb
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)