QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #134829 | #6636. Longest Strictly Increasing Sequence | Rd_rainydays# | AC ✓ | 1ms | 3516kb | C++20 | 695b | 2023-08-05 09:11:09 | 2023-08-05 09:11:13 |
Judging History
answer
#include <bits/stdc++.h>
void solve() {
int n;
std::cin >> n;
static int b[12];
memset(b,0, sizeof(b));
for (int i = 1; i <= n; i++) std::cin >> b[i];
for (int i = 1; i <= n; i++) {
if (b[i] > i) {
std::cout << "NO\n";
return;
}
if (b[i] - b[i - 1] > 1) {
std::cout << "NO\n";
return;
}
if (b[i] < b[i - 1]) {
std::cout << "NO\n";
return;
}
}
std::cout << "YES\n";
std::cout << "1 ";
for (int i = 2, j = 1; i <= n; i ++) {
if (b[i] == b[i - 1] + 1) ++j;
std::cout << j << ' ';
}
std::cout << '\n';
}
int main() {
int T; std::cin >> T;
while (T--) solve();
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3516kb
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: 3444kb
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)