제출 #322363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
322363		Karen124	Global Warming (CEOI18_glo)	C++14	25 / 100	102 ms	3820 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 l, int r, int add){
    int len = 0, p = 0;
    for (int i = 0; i <= n + 5; i++){
        b[i] = 0;
    }
    for (int i = 1; i <= n; i++){
        p = lower_bound(b, b + len, a[i] + (l <= i && i <= r) * add) - b;
        b[p] = a[i] + (l <= i && i <= r) * add;
        len = max(len, p + 1);
    }
    if (l == 0 && r == 0){
        cout << len << '\n';
        exit(0);
    }
    return len;
}
int main() {
    cin >> n >> X;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if (X == 0) {LIS(0, 0, 0);}
    else if (n <= 50 && X <= 50){
        for (int l = 1; l <= n; l++){
            for (int r = l; r <= n; r ++){
                for (int i = -X; i <= X; i++){
                    ans = max(ans, LIS(l, r, i));
                }
            }
        }
        cout << ans << '\n';
    }
    else {return 0;}
    return 0;
}

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