QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #594707 | #6636. Longest Strictly Increasing Sequence | UESTC_DECAYALI# | AC ✓ | 2ms | 3908kb | C++20 | 780b | 2024-09-28 09:49:18 | 2024-09-28 09:49:18 |
Judging History
answer
#include<cstdio>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=15;
int t,n,a[N],ans[N],L[N],R[N];
int main()
{
for (scanf("%d",&t);t;--t)
{
scanf("%d",&n);
for (RI i=1;i<=n;++i) scanf("%d",&a[i]);
bool flag=(a[1]==1);
for (RI i=1;i<n;++i) if (a[i+1]-a[i]!=0&&a[i+1]-a[i]!=1) { flag=0; break; }
if (!flag) { puts("NO"); continue; }
for (RI i=1;i<=10;++i) L[i]=n+1,R[i]=0;
for (RI i=1;i<=n;++i) L[a[i]]=min(L[a[i]],i),R[a[i]]=max(R[a[i]],i);
int idx=0; for (RI i=1;i<=10;++i)
for (RI j=R[i];j>=L[i];--j) ans[j]=++idx;
puts("YES");
for (RI i=1;i<=n;++i) printf("%d%c",ans[i]," \n"[i==n]);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3908kb
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: 3812kb
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 5 4 6 9 8 7 10 YES 2 1 6 5 4 3 7 9 8 10 NO NO NO YES 1 7 6 5 4 3 2 10 9 8 YES 2 1 3 4 5 9 8 7 6 10 YES 1 2 3 4 6 5 8 7 9 NO NO YES 1 2 6 5 4 3 9 8 7 10 NO NO YES 1 3 2 4 8 7 6 5 10 9 NO NO NO NO NO NO YES 3 2 1 5 4 7 6 9 8 NO NO NO NO NO NO NO YES 1 2 5 4 3 8 7 6 10 9 YES 2 1 5 4 3 1...
result:
ok t=3483 (3483 test cases)