Submission #927475

#	Time	Username	Problem	Language	Result	Execution time	Memory
927475		OAleksa	Global Warming (CEOI18_glo)	C++14	100 / 100	48 ms	7772 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 2e5 + 69;
const int inf = 1e9 + 69;
int n, a[N], x, dp[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
	  cin >> n >> x;
	  for (int i = 1;i <= n;i++)
	  	cin >> a[i];
  	int ans = 0;
  	vector<int> dp(n, inf), bst(n + 1, inf);
  	for (int i = 1;i <= n;i++) {
  		auto u = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
  		ans += (dp[u] == inf);
  		dp[u] = a[i];
  		bst[i] = u + 1;
  	}
  	fill(dp.begin(), dp.end(), inf);
	 	for (int i = n;i >= 1;i--) {
	 		auto u = lower_bound(dp.begin(), dp.end(), -(a[i] - x)) - dp.begin();
	 		ans = max(ans, bst[i] + u);
	 		u = lower_bound(dp.begin(), dp.end(), -a[i]) - dp.begin();
	 		dp[u] = -a[i];
	 	}
	 	cout << ans;
  }
  return 0;
}

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