제출 #1263828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263828		elotelo966	Global Warming (CEOI18_glo)	C++20	100 / 100	526 ms	58736 KiB

glo

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 400005

typedef long long lo;

int n,x;

int dizi[lim];

int timer;

set<int> st;

map<int,int> mp;

int arr[lim];

int dp[lim],dp2[lim];

int tree[4*lim];

inline int query(int node,int start,int end,int l,int r){
	if(start>end || start>r || end<l)return 0;
	if(start>=l && end<=r)return tree[node];
	return max(query(node*2,start,mid,l,r),query(node*2+1,mid+1,end,l,r));
}

inline void update(int node,int start,int end,int l,int r,int val){
	if(start>end || start>r || end<l)return ;
	if(start>=l && end<=r){
		tree[node]=val;
		return ;
	}
	update(node*2,start,mid,l,r,val),update(node*2+1,mid+1,end,l,r,val);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}

inline void build(int node,int start,int end){
	tree[node]=0;
	if(start==end)return ;
	build(node*2,start,mid),build(node*2+1,mid+1,end);
}

int32_t main(){
	faster
	cin>>n>>x;
	FOR{
		cin>>dizi[i];
		st.insert(dizi[i]);
		if(dizi[i]>x)st.insert(dizi[i]-x);
	}
	
	for(auto a:st){
		mp[a]=++timer;
	}
	
	FOR{
		arr[i]=mp[dizi[i]];
		int tut=query(1,1,timer,1,arr[i]-1);
		dp[i]=tut+1;
		update(1,1,timer,arr[i],arr[i],dp[i]);
		//cout<<dp[i]<<" ";
	}
	
	build(1,1,timer);
	
	int cev=query(1,1,timer,1,timer);
	
	for(int i=n;i>=1;i--){
		int tut=query(1,1,timer,arr[i]+1,timer);
		dp2[i]=tut+1;
		if(i!=n){
			int cur=dp[i];
			if(dizi[i]>x){
				cur+=query(1,1,timer,mp[dizi[i]-x]+1,timer);
			}
			else cur+=query(1,1,timer,1,timer);
			cev=max(cev,cur);
		}
		update(1,1,timer,arr[i],arr[i],dp2[i]);
	}
	
	cout<<cev<<'\n';
	
	return 0;
}

• 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