제출 #1127577

#제출 시각아이디문제언어결과실행 시간메모리
1127577Haciyev12Global Warming (CEOI18_glo)C++20
10 / 100
29 ms3080 KiB
#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define endl '\n'
#define pii pair<ll,ll>
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
using namespace std;
const ll INF = 1e18, mod = 1e9 + 7, N = 2e5 + 5;
ll gcd(ll a, ll b){
 if(b == 0){
 return a;
 }
 return gcd(b, a%b);
}
ll lcm(ll a, ll b){
    return (a / gcd(a,b)) * b;
}
ll lis(vector<ll>&a){
    vector<ll>ans;
    for(int i = 0; i < a.size(); i++){
        auto it = lower_bound(all(ans), a[i]);
        if(it == ans.end()){
            ans.pb(a[i]);
        }
        else{
            *it = a[i];
        }
        
    }
    return ans.size();
}
void solve(){
    ll n,x;
    cin >> n >> x;
    vector<ll>a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    cout << lis(a);
}
int main() {
    fast;
    ll t = 1;
   // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
#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...