답안 #581682

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581682	2022-06-23T03:39:04 Z	KingJt	Global Warming (CEOI18_glo)	C++17	25 / 100	2000 ms	2516 KB

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.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	21 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	72 ms	296 KB	Output is correct
15	Correct	32 ms	212 KB	Output is correct
16	Correct	31 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #3

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	21 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	72 ms	296 KB	Output is correct
15	Correct	32 ms	212 KB	Output is correct
16	Correct	31 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Execution timed out	2069 ms	212 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	1876 KB	Output is correct
2	Correct	30 ms	1888 KB	Output is correct
3	Correct	41 ms	1844 KB	Output is correct
4	Correct	43 ms	1892 KB	Output is correct
5	Correct	28 ms	2516 KB	Output is correct

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2073 ms	912 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2074 ms	1492 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	21 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	72 ms	296 KB	Output is correct
15	Correct	32 ms	212 KB	Output is correct
16	Correct	31 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Execution timed out	2069 ms	212 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-