Submission #322352

#	Time	Username	Problem	Language	Result	Execution time	Memory
322352		Karen124	Global Warming (CEOI18_glo)	C++14	10 / 100	105 ms	3180 KiB

glo

#include <bits/stdc++.h>
     
using namespace std;
     
#define ll long long int 
#define F first
#define S second
#define pb push_back
 
const ll N = 2e5 + 10;
const ll LOG = 50;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 10;
int n, X, a[N], b[N], dp[2][N], ans;
int LIS(){
    int len = 0, p = 0;
    for (int i = 1; i <= n; i++){
        p = lower_bound(b, b + len, a[i]) - b;
        b[p] = a[i];
        len = max(len, p + 1);
    }
    cout << len << '\n';
    exit(0);
}
int main() {
    cin >> n >> X;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if (X == 0) {LIS();}
    else {return 0;}
    for (int i = 1; i <= n; i++){
        ans = max({ans, dp[0][i], dp[1][i]});
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 10 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25