Submission #763640

#	Time	Username	Problem	Language	Result	Execution time	Memory
763640		AutomatiC__	Global Warming (CEOI18_glo)	C++17	0 / 100	66 ms	4504 KiB

glo

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cstdlib>
#include <bitset>
#include <deque>
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200005;
int a[maxn];
int n, x;
int f[maxn], g[maxn]; // f prefix, g suffix
int main() {
    cin >> n >> x;
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<int> dp;
    for (int i = 1; i <= n; i++) {
        if (dp.empty() || a[i] > dp.back()) {
            dp.push_back(a[i]);
            f[i] = dp.size();
        } else {
            int pos = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
            dp[pos] = a[i];
            f[i] = pos + 1;
        }
    }
    dp.clear();
    for (int i = n; i >= 1; i--) {
        int d = -(a[i] - x);
        if (dp.empty() || d < dp.back()) {
            dp.push_back(-a[i]);
            g[i] = dp.size();
        } else {
            int pos = lower_bound(dp.begin(), dp.end(), d) - dp.begin();
            dp[pos] = -a[i];
            g[i] = pos + 1;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, f[i] + g[i]);
    }
    cout << ans << endl;
    return 0;
}

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