QOJ.ac

QOJ

The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#127012	#6636. Longest Strictly Increasing Sequence	ylf	AC ✓	2ms	3464kb	C++17	955b	2023-07-19 12:17:28	2023-07-19 12:17:45

Judging History

This is the latest submission verdict.

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

[2023-07-19 12:17:45]
Judged

Verdict: AC
Time: 2ms
Memory: 3464kb

Show

[2023-07-19 12:17:28]
Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+10;
ll t,n,d,h,A[N];
void solve()
{
    cin>>n;
    for(ll a=1;a<=n;a++)
    {
        cin>>A[a];
    }
    for(ll a=1;a<=n;a++)
    {
        if(A[a]>a) 
        {
            cout<<"NO\n";
            return ;
        }
    }
    for(ll a=1;a<n;a++)
    {
        if(A[a+1]<A[a]) 
        {
            cout<<"NO\n";
            return ;
        }
    }
    for(ll a=1;a<n;a++)
    {
        if(A[a+1]-A[a]>1)
        {
            cout<<"NO\n";
            return ;
        }
    }
    cout<<"YES\n";
    ll st=1;
    cout<<1;
    for(ll a=2;a<=n;a++)
    {
        if(A[a]==A[a-1]) cout<<" "<<st;
        else st++,cout<<" "<<st;
    }
    cout<<"\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>t;
    while(t--)
    {
       solve();
       
    }
   
    
    

}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3464kb

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 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)