QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #579662 | #6636. Longest Strictly Increasing Sequence | martinga# | AC ✓ | 3ms | 3740kb | C++20 | 715b | 2024-09-21 16:48:20 | 2024-09-21 16:48:21 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define NO cout << "NO\n"; return
void solveCase()
{
int n; cin >> n;
vector<lli> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
if (v[0] != 1)
{
NO;
}
for (int i = 0; i < n - 1; i++)
{
lli diff = v[i+1] - v[i];
if (diff < 0 || diff > 1)
{
NO;
}
}
cout << "YES\n";
cout << v[0];
for (int i = 1; i < n; i++)
{
cout << " " << v[i];
}
cout << "\n";
return;
}
int main()
{
int nCases; cin >> nCases;
while (nCases--)
{
solveCase();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
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: 3ms
memory: 3740kb
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 3 3 3 3 ...
result:
ok t=3483 (3483 test cases)