QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#134833 | #6636. Longest Strictly Increasing Sequence | Vengeful_Spirit# | AC ✓ | 4ms | 8256kb | C++20 | 794b | 2023-08-05 09:11:58 | 2023-08-05 09:11:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MN = 2e5 + 5;
vector<int> G[MN];
bool vis[MN];
bool solve() {
int n;
cin >> n;
vector<int> b(n);
for(int& x : b) cin >> x;
vector<int> a(n);
for(int i = 0; i < n; ++i) {
if(i > 0) {
if(b[i] == b[i - 1]) a[i] = a[i - 1];
else if(b[i] == b[i - 1] + 1) a[i] = a[i - 1] + 1;
else return false;
} else {
if(b[i] != 1) return false;
a[i] = 1;
}
}
cout << "YES\n";
for(int x : a) cout << x << " ";
cout << "\n";
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while(T--) {
if(!solve()) cout << "NO\n";
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 8256kb
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: 4ms
memory: 8152kb
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)