oj.uz

답안 #470284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470284 2021-09-03T11:27:18 Z mychecksedad Global Warming (CEOI18_glo) C++17
15 / 100
 51 ms 5336 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
typedef long long int ll;
#define pb push_back
int n, ans = 0;
ll arr[N], x, dp[N];
int main(){
	cin.tie(0); ios::sync_with_stdio(0);
	cin >> n >> x;
	for(int i = 1; i <= n; i++) cin >> arr[i];
	vector<int> lis(1, 0);
	for(int j = 1; j <= n; j++){
		int pos = lower_bound(lis.begin(), lis.end(), arr[j]) - lis.begin();
		if(pos == int(lis.size())) lis.pb(arr[j]);
		else lis[pos] = arr[j];
		dp[j] = pos;
	}
	lis.clear();
	lis.pb(-1e9);
	for(int i = n; i >= 1; i--){
		int new_pos = lower_bound(lis.begin(), lis.end(), -(arr[i] - x)) - lis.begin();
		ans = max(ll(dp[i] + new_pos)-1, ll(ans));
		int pos = lower_bound(lis.begin(), lis.end(), -arr[i]) - lis.begin();
		if(pos == lis.size()) lis.pb(-arr[i]);
		else lis[pos] = arr[i];
	}
	cout << ans;



	return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:25:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   if(pos == lis.size()) lis.pb(-arr[i]);
      |      ~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Incorrect 1 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Incorrect 1 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 5336 KB Output is correct
2 Correct 51 ms 5296 KB Output is correct
3 Correct 40 ms 5336 KB Output is correct
4 Correct 40 ms 5316 KB Output is correct
5 Correct 28 ms 5016 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1484 KB Output is correct
2 Correct 12 ms 1556 KB Output is correct
3 Correct 10 ms 1484 KB Output is correct
4 Incorrect 8 ms 1560 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 2788 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Incorrect 1 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -