Submission #785180

#TimeUsernameProblemLanguageResultExecution timeMemory
785180christinelynnGlobal Warming (CEOI18_glo)C++17
10 / 100
29 ms4364 KiB
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
int n, x;
int arr[200004], dp[200004];
signed main() {
    ioss;
    cin >> n >> x;
    if(x == 0) {
        for(int i = 0; i < n; i++) cin >> arr[i];

        vector<int> tmp;
        for(int i = 0; i < n; i++) {
            if(i == 0) {
                dp[i] = 1;
                tmp.pb(arr[i]);
                continue;
            }
            if(arr[i] > tmp.back()) dp[i] = dp[i-1]+1, tmp.pb(arr[i]);
            else {
                int cur = lower_bound(tmp.begin(), tmp.end(), arr[i])-tmp.begin();
                tmp[cur] = arr[i];
                dp[i] = dp[i-1];
                // for(auto x : tmp) cout << x << " ";
                // cout << endl;
            }
            // cout << " :: " << arr[i] << " " << tmp.back() << " " << dp[i] << endl;
        }
        cout << dp[n-1] << endl;
    }
}
#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...