QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#431466 | #6636. Longest Strictly Increasing Sequence | ucup-team3215# | AC ✓ | 2ms | 3728kb | C++23 | 640b | 2024-06-05 16:57:39 | 2024-06-05 16:57:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> b(n);
for (auto &i: b)cin >> i;
vector<int> res;
int prev = 0;
for (int i = 0; i < n; ++i) {
if (b[i] < prev || b[i] > prev + 1) {
cout << "NO\n";
return;
}
if (b[i] == prev)res.push_back(1);
else res.push_back(b[i]);
prev = b[i];
}
cout << "YES\n";
for (auto x: res) { cout << x << " "; }
cout << "\n";
}
int main() {
cin.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3728kb
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: 2ms
memory: 3596kb
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 1 5 6 1 1 7 YES 1 1 2 1 1 1 3 4 1 5 NO NO NO YES 1 2 1 1 1 1 1 3 1 1 YES 1 1 2 3 4 5 1 1 1 6 YES 1 2 3 4 5 1 6 1 7 NO NO YES 1 2 3 1 1 1 4 1 1 5 NO NO YES 1 2 1 3 4 1 1 1 5 1 NO NO NO NO NO NO YES 1 1 1 2 1 3 1 4 1 NO NO NO NO NO NO NO YES 1 2 3 1 1 4 1 1 5 1 YES 1 1 2 1 1...
result:
ok t=3483 (3483 test cases)