QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #134858 | #6636. Longest Strictly Increasing Sequence | nameless_story# | AC ✓ | 3ms | 3564kb | C++20 | 448b | 2023-08-05 09:23:28 | 2023-08-05 09:23:28 |
Judging History
answer
#include"bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(),(x).end()
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
int T=0; cin>>T;
while (T--)
{
int n,i,j;
cin>>n;
vector<int> a(n);
for (int &x:a) cin>>x;
bool flg=a[0]==1;
for (i=1; i<n; i++) flg&=a[i]>=a[i-1]&&a[i]<=a[i-1]+1;
if (flg)
{
cout<<"YES\n";
for (i=0; i<n; i++) cout<<a[i]<<" \n"[i+1==n];
}
else cout<<"NO\n";
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 3ms
memory: 3496kb
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 3 3 3 3 ...
result:
ok t=3483 (3483 test cases)