QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#114356	#6636. Longest Strictly Increasing Sequence	kingstonduy	AC ✓	3ms	3444kb	C++14	1.4kb	2023-06-21 23:48:04	2023-06-21 23:48:06

Judging History

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

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

[2023-06-21 23:48:06]
评测

测评结果：AC
用时：3ms
内存：3444kb

查看

[2023-06-21 23:48:04]
提交

answer

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define openr() freopen("input.txt","r",stdin)
#define openw() freopen("output.txt","w",stdout)
#define mp make_pair
#define fi first
#define se second
#define int long long int

using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

const int inf=1e9;
const int maxn=200001;
const int mod= 1000000007;


int longestIncreasingSubsequence(vector<int>&v, int r)
{
    vector<int>d(r+1,1);
    int ans=1;
    for(int i=1;i<=r;i++)
    {
        for(int j=1;j<i;j++)
        {
            if(v[j] < v[i])
            {
                d[i]= max(d[i], d[j] + 1);
                ans=max(ans,d[i]);
            }
        }
    }
    return ans;
}



void show()
{
    int n;  cin>>n;
    vector<int>v(n+1);
    for(int i=1;i<=n;i++)   cin>>v[i];
    for(int i=1;i<=n;i++)
    {
        if(v[i] != longestIncreasingSubsequence(v,i))
        {
            cout<<"NO";
            return;
        }
    }
    cout<<"YES\n";
    for(int i=1;i<=n;i++)   cout<<v[i]<<" ";
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    //openr();
    int tc; cin>>tc;
    while(tc--)
    {
        show();
        cout<<"\n";
    }
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3444kb

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

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)