QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #134864 | #6636. Longest Strictly Increasing Sequence | kiwiHM# | AC ✓ | 3ms | 3876kb | C++14 | 561b | 2023-08-05 09:28:24 | 2023-08-05 09:28:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n;
int b[15];
inline void solve(){
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", b + i);
if(b[1] != 1){ puts("NO"); return; }
for(int i = 2; i <= n; ++i) if(b[i] != b[i - 1] && b[i] != b[i - 1] + 1){
puts("NO"); return;
}
puts("YES");
int curmx = 50, curmn = 20;
for(int i = 1; i <= n; ++i){
if(b[i] == b[i - 1] + 1) printf("%d ", ++curmx);
else printf("%d ", --curmn);
}
puts("");
}
int main(){
int T;
for(scanf("%d", &T); T--; solve());
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3876kb
input:
2 6 1 2 3 2 5 7 2 1 2
output:
NO YES 51 52
result:
ok t=2 (2 test cases)
Test #2:
score: 0
Accepted
time: 3ms
memory: 3592kb
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 51 52 53 54 19 55 56 18 17 57 YES 51 19 52 18 17 16 53 54 15 55 NO NO NO YES 51 52 19 18 17 16 15 53 14 13 YES 51 19 52 53 54 55 18 17 16 56 YES 51 52 53 54 55 19 56 18 57 NO NO YES 51 52 53 19 18 17 54 16 15 55 NO NO YES 51 52 19 53 54 18 17 16 55 15 NO NO NO NO NO NO YES 51 19 18 ...
result:
ok t=3483 (3483 test cases)