Submission #1318622

#TimeUsernameProblemLanguageResultExecution timeMemory
1318622yusifmGlobal Warming (CEOI18_glo)C++20
0 / 100
16 ms2536 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000,MOD=1000000007;
using namespace std;
void solve()
{
    ll n,m,num,cnt,ans=0;
    cin>>n>>m;
    vector<ll>nums,res;
    for(int i=0;i<n;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    for(int i=0;i<nums.size();i++)
    {
        cnt=lower_bound(all(res),nums[i])-nums.begin();
        if(cnt==ans)
        {
            ans++,res.pb(nums[i]);
        }
        else
        {
            res[cnt]=nums[i];
        }
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...