Submission #581682

#	Time	Username	Problem	Language	Result	Execution time	Memory
581682		KingJt	Global Warming (CEOI18_glo)	C++17	25 / 100	2074 ms	2516 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bn binary_search
#define sz(x) int((x).size())
#define lz(x) long long((x).size())
#define INF 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ll> vl;
typedef pair<ll,ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<pair<int,ii>> gw;
typedef vector<pair<ll,il>> lw;
typedef vector<vc> vvc;
vi perma;
int lis(){
	vi lisis;
	for(int i=0;i<sz(perma);i++){
		auto u=lower_bound(lisis.begin(), lisis.end(),perma[i]);
		if(u==lisis.end()){
			lisis.pb(perma[i]);
		}else *u=perma[i];
	}
	return sz(lisis);
}
void solve(){
	int n, x;
	cin>>n>>x;
	vi in(n);
	for(int i=0;i<n;i++) cin>>in[i];
	int ans=0;
	if(x==0){
		perma=in;
		cout<<lis()<<endl;
		return;
	}
	for(int change=-x;change<=x;change++){
		for(int i=0;i<n;i++){
			for(int j=i;j<n;j++){
				vi copy=in;
				for(int l=i;l<=j;l++) copy[l]+=change;
				perma=copy;
				//if(change=-5&&i==1&&j==2) cout<<lis()<<endl;
				ans=max(ans,lis());
			}
		}
	}
	cout<<ans<<endl;
}
int main(){
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}

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