답안 #126070

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126070	2019-07-07T01:45:41 Z	briansu	Global Warming (CEOI18_glo)	C++14	100 / 100	72 ms	6384 KB

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS()
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t> void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
	fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
	_do(__VA_ARGS__);\
}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...)
#define endl '\n'
#endif

const ll MAXn = 2e5 + 5;
const ll INF = ll(1e17);
const ll MOD = 1000000007;

ll d[MAXn], dt[MAXn];

int main(){
	IOS();
	ll n, x;
	cin>>n>>x;
	REP1(i, n)cin>>d[i];

	vector<ll> v;

	for(int i = n;i > 0;i --){
		if(!SZ(v) || d[i] < v.back())v.pb(d[i]), dt[i] = SZ(v);
		else 
		{
			ll t = lower_bound(ALL(v), d[i], greater<ll>()) - v.begin();
			dt[i] = t + 1;
			v[t] = d[i];
		}
	}

	ll mx = SZ(v);
	v.clear();

	REP1(i, n)
	{
		mx = max(mx, dt[i] + (lower_bound(ALL(v), d[i] + x) - v.begin()));
		if(!SZ(v) || d[i] > v.back())v.pb(d[i]);
		else *lower_bound(ALL(v), d[i]) = d[i];
	}

	cout<<mx<<endl;

}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	380 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	504 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	424 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	71 ms	5368 KB	Output is correct
2	Correct	70 ms	5368 KB	Output is correct
3	Correct	70 ms	5332 KB	Output is correct
4	Correct	71 ms	5368 KB	Output is correct
5	Correct	37 ms	5616 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	1656 KB	Output is correct
2	Correct	18 ms	1656 KB	Output is correct
3	Correct	18 ms	1656 KB	Output is correct
4	Correct	10 ms	1784 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	11 ms	1784 KB	Output is correct
7	Correct	15 ms	1656 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	2972 KB	Output is correct
2	Correct	31 ms	2920 KB	Output is correct
3	Correct	65 ms	5372 KB	Output is correct
4	Correct	38 ms	5616 KB	Output is correct
5	Correct	20 ms	3064 KB	Output is correct
6	Correct	34 ms	5492 KB	Output is correct
7	Correct	37 ms	6128 KB	Output is correct
8	Correct	27 ms	2936 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	380 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	504 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	424 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	71 ms	5368 KB	Output is correct
28	Correct	70 ms	5368 KB	Output is correct
29	Correct	70 ms	5332 KB	Output is correct
30	Correct	71 ms	5368 KB	Output is correct
31	Correct	37 ms	5616 KB	Output is correct
32	Correct	18 ms	1656 KB	Output is correct
33	Correct	18 ms	1656 KB	Output is correct
34	Correct	18 ms	1656 KB	Output is correct
35	Correct	10 ms	1784 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	11 ms	1784 KB	Output is correct
38	Correct	15 ms	1656 KB	Output is correct
39	Correct	31 ms	2972 KB	Output is correct
40	Correct	31 ms	2920 KB	Output is correct
41	Correct	65 ms	5372 KB	Output is correct
42	Correct	38 ms	5616 KB	Output is correct
43	Correct	20 ms	3064 KB	Output is correct
44	Correct	34 ms	5492 KB	Output is correct
45	Correct	37 ms	6128 KB	Output is correct
46	Correct	27 ms	2936 KB	Output is correct
47	Correct	35 ms	2936 KB	Output is correct
48	Correct	40 ms	2936 KB	Output is correct
49	Correct	72 ms	5496 KB	Output is correct
50	Correct	38 ms	5588 KB	Output is correct
51	Correct	32 ms	4464 KB	Output is correct
52	Correct	39 ms	5748 KB	Output is correct
53	Correct	35 ms	5620 KB	Output is correct
54	Correct	39 ms	6384 KB	Output is correct
55	Correct	57 ms	5476 KB	Output is correct

답안 #126070

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0