Submission #1274711

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274711		hiepsimauhong	Global Warming (CEOI18_glo)	C++20	100 / 100	1287 ms	60708 KiB

glo

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const int64_t oo = 1e18;
//#define int long long
//#define float long double

#define quickly ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define FOR(I, L, R) for(int I(L) ; I <= (int)R ; ++I)
#define FOD(I, R, L) for(int I(R) ; I >= (int)L ; --I)
#define FOA(I, A) for(auto I : A)
#define print(A,L,R) FOR(OK, L, R){if(A[OK]<=-oo||A[OK]>=oo)cout<<"- ";else cout<<A[OK]<<' ';}cout<<'\n';
#define prints(A) FOA(OK, A){cout<<OK<<' ';}cout << '\n';
#define printz(A,L,R) FOR(OK, 1, L){FOR(KO, 1, R){if(A[OK][KO]>-oo&&A[OK][KO]<oo)cout<<A[OK][KO]<<' ';else cout << "- ";} cout << '\n';}cout << '\n';
#define fs first
#define sd second
#define se sd.fs
#define th second.second
#define ii pair<int,int>
#define iii pair<int, ii>
#define all(A) A.begin(), A.end()

const int N = 5e5 + 5;
const int mod = 1e9 + 7;

int n, m, x;
int a[N];
map<int, int> mp;

struct Segment_tree{
        int sg[N << 3];

        void reset(){
                memset(sg, 0, sizeof sg);
        }

        void update(int id, int l, int r, int pos, int val){
                if(l > pos || r < pos){
                        return;
                }
                if(l == r){
                        sg[id] = max(sg[id], val);
                        return;
                }

                int mid = (l + r) >> 1;

                update(id << 1, l, mid, pos, val);
                update(id << 1 | 1, mid + 1, r, pos, val);

                sg[id] = max(sg[id << 1], sg[id << 1 | 1]);
        }

        int get(int id, int l, int r, int u, int v){
                if(l > v || r < u){
                        return 0;
                }
                if(u <= l && r <= v){
                        return sg[id];
                }

                int mid = (l + r) >> 1;
                return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
        }
} sg[2];

signed main(){ quickly
        cin >> n >> x;

        FOR(i, 1, n){
                cin >> a[i];
                mp[a[i]] = mp[a[i] - x] = mp[a[i] + x] = 1;
        }

        FOA(i, mp){
                mp[i.fs] = ++m;
        }

        int ans = 0;
        FOR(i, 1, n){
                int p1 = mp[a[i]], p2 = mp[a[i] + x];

                int G0 = sg[0].get(1, 1, m, 1, p1 - 1);
                int G1 = sg[0].get(1, 1, m, 1, p2 - 1);
                int G2 = sg[1].get(1, 1, m, 1, p1 - 1);

                sg[0].update(1, 1, m, p1, G0 + 1);
                sg[1].update(1, 1, m, p1, max(G1, G2) + 1);
        }
        ans = max({ans, sg[0].sg[1], sg[1].sg[1]});

        sg[0].reset(); sg[1].reset();

        FOD(i, n, 1){
                int p1 = mp[a[i]], p2 = mp[a[i] - x];

                int G0 = sg[0].get(1, 1, m, p1 + 1, m);
                int G1 = sg[0].get(1, 1, m, p2 + 1, m);
                int G2 = sg[1].get(1, 1, m, p1 + 1, m);

                sg[0].update(1, 1, m, p1, G0 + 1);
                sg[1].update(1, 1, m, p1, max(G1, G2) + 1);
        }
        ans = max({ans, sg[0].sg[1], sg[1].sg[1]});

        cout << ans;
}

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