QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#134863	#6636. Longest Strictly Increasing Sequence	ckz^#	AC ✓	2ms	3488kb	C++20	902b	2023-08-05 09:26:49	2023-08-05 09:26:53

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-08-05 09:26:53]
评测

测评结果：AC
用时：2ms
内存：3488kb

查看

[2023-08-05 09:26:49]
提交

answer

#include<bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(),(a).end()
using namespace std;

const int N = 2e5 + 10;

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];

    if(a[0] != 1)
    {
        cout << "NO" << '\n';
        return;
    }
    for(int i = 1; i < n; i++)
    {
        if(a[i] != a[i - 1] && a[i] != a[i - 1] + 1)
        {
            cout << "NO" << '\n';
            return;
        }
    }

    cout << "YES" << '\n';
    int tot = 0;
    cout << ++tot << ' ';
    for(int i = 1; i < n; i++)
    {
        if(a[i] > a[i - 1]) cout << ++tot << ' ';
        else cout << 1 << ' ';
    }
    cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3488kb

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: 3452kb

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)