제출 #793353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793353		arashMLG	Global Warming (CEOI18_glo)	C++17	100 / 100	51 ms	8524 KiB

glo

#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

//https://quera.org/profile/4dykhk

typedef long long     ll;
typedef long double   ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;

const int N = 2e5 + 23;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define F           first
#define S           second
#define pb          push_back
#define ms(x,y)     memset((x) , (y) , sizeof (x))
#define done        return cout<<endl , 0;
#define kill(x)     cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define pc(x)       __builtin_popcount(x)
#define ctz(x)      __builtin_ctz(x)
#define MinHeap(x)  priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x)  priority_queue<x, vector<x>>
#define lc          (v << 1)
#define rc          ((v<<1) |1)
#define int      ll

ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n,x;
int a[N];
vector<int> dp(N,inf);
int l[N];

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>x;
	for(int i=  0; i < n ; i++) cin>>a[i];
	
	for(int i = 0 ; i< n ; i ++) {
		int pos = lower_bound(all(dp),a[i]) - dp.begin();
		dp[pos] = a[i];
		l[i] = pos + 1;
	}
	int ans = *max_element(l,l+n);
	dp = vector<int>(N,inf);
	for(int i = n-1; i >= 0 ; i--) {
		int pos  = lower_bound(all(dp),-a[i] + x) - dp.begin();
		ans = max(ans,pos + l[i]);
		pos= lower_bound(all(dp),-a[i]) - dp.begin();
		dp[pos] = -a[i];
	}
	cout<<ans;
    done;
}

• 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