Submission #397668

#	Time	Username	Problem	Language	Result	Execution time	Memory
397668		Victor	Global Warming (CEOI18_glo)	C++17	38 / 100	2067 ms	3792 KiB

glo

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, x, ans = 0, temps[200001];
    cin >> n >> x;
    vi subseq;

    rep(i, 0, n) cin >> temps[i];

    if (!x) {
        subseq.assign(n, 0);
        int longest = 0;
        rep(i, 0, n) {
            int temp = temps[i];

            int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
            subseq[idx] = temp;
            if (idx == longest) ++longest;
        }
        ans = longest;
    }

    else
        rep(i, 0, n+1) {
            subseq.assign(n, 0);
            int longest = 0;
            
            rep(j, 0, n) {
                int temp = temps[j];
                if (j < i) temp -= x;

                int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
                subseq[idx] = temp;
                if (idx == longest) ++longest;
            }
            ans = max(ans, longest);
            
            subseq.assign(n, 0);
            longest = 0;
            rep(j, 0, n) {
                int temp = temps[i];
                if (j >= i) temp += x;

                int idx = lower_bound(subseq.begin(), subseq.begin() + longest, temp) - subseq.begin();
                subseq[idx] = temp;
                if (idx == longest) ++longest;
            }
            ans = max(ans, longest);
        }

    cout << ans << endl;
    return 0;
}

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