QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #127700 | #6636. Longest Strictly Increasing Sequence | xjsc01 | AC ✓ | 1ms | 3848kb | C++23 | 546b | 2023-07-19 22:24:18 | 2023-07-19 22:24:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int a[N], b[N];
int main()
{
int T;
cin >> T;
while(T--){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", b + i);
}
bool ok = true;
//if(b[1] != 1) ok =false;
for(int i = 1; i <= n; i++){
int t = b[i] - b[i-1];
if(t < 0 || t >= 2){
ok = false;
break;
}
}
if(ok){
puts("YES");
for(int i = 1; i <= n; i++) printf("%d ", b[i]);
puts("");
}
else{
puts("NO");
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3848kb
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: 3816kb
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)