QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #125417 | #6636. Longest Strictly Increasing Sequence | Iancsy | AC ✓ | 1ms | 3612kb | C++20 | 886b | 2023-07-16 17:50:10 | 2023-07-16 17:50:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int mn = 15;
vector<int> g[mn];
int a[mn], b[mn];
int main() {
int T, n;
scanf("%d", &T);
while(T--) {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
bool err = 0;
for(int i = 1; i <= n; i++) {
if(a[i] - a[i - 1] > 1 || a[i] < a[i - 1]) {
err = 1;
break;
}
}
if(err) {
puts("NO");
continue;
}
puts("YES");
for(int i = 1; i <= n; i++) {
if(a[i] == a[i - 1]) {
b[i] = b[i - 1];
} else {
b[i] = b[i - 1] + 1;
}
}
for(int i = 1; i <= n; i++) {
printf("%d ", b[i]);
}
puts("");
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3612kb
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: 0ms
memory: 3580kb
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)