제출 #699845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
699845		Iliya_	Global Warming (CEOI18_glo)	C++14	10 / 100	2076 ms	3436 KiB

glo

// IN THE NAME OF GOD
#include<bits/stdc++.h>
//#pragma GCC optimize ("O2,unroll-loops,O3,Ofast,no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define endl '\n';
#define file_reading freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
using namespace std;
typedef long long ll;
typedef long double dll;
typedef unsigned long long ull;

const ll B = 2e5+7, inf = 1e18; 
int arr[B],arr2[B];
int n,x; 

ll ans_(){
	vector<ll> dp(n+1,inf);
	dp[0] = -inf; 
	dp[1] = arr[1]; 
	int ans = 1; 
	for(int i=2; i<=n; i++){
		int ind = lower_bound(dp.begin(),dp.end(),arr[i])-dp.begin(); 
		dp[ind] = arr[i];
		ans = max(ans,ind); 
	}
	return ans;
}

void solve(){
	cin >> n >> x; 
	for(int i=1; i<=n; i++){cin >> arr[i]; arr2[i] = arr[i];}
	if (x == 0){cout << ans_() << endl; return;}
	if (x <= 50 && x <= 50){
		ll ans = 0; 
		for(int i=1; i<=n; i++){
			for(int j=i; j<=n; j++){
				for(int change = -x; change <= x; change++){
					arr[j]+=change; 	
					ans = max(ans,ans_()); 
				}
			}
			for(int j=i; j<=n; j++){arr[j] = arr2[j];}
		}
		cout << ans << endl;
	}
}
 
int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t; t=1;
	while(t--){solve();}
	return 0;
}

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