제출 #863387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863387		Armin	Global Warming (CEOI18_glo)	C++17	100 / 100	56 ms	4716 KiB

glo

/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 3e5 + 8, SQ = 500, INF = 2e9 + 8, LGN = 11, mod = 998244353;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, x, a[N], l[N], ans;
vector <int> v(N, INF);

int32_t main(){
  fast_io;
  cin >> n >> x;
  FOR (i, 0, n){
    cin >> a[i];
  }
  v[0] = -INF;
  FOR (i, 0, n){
    int p = lower_bound (all(v), a[i]) - v.begin();
    v[p] = a[i];
    l[i] = p;
    ans = max (ans, p);
  }
  FOR (i, 0, n){
    v[i] = INF;
  }
  v[0] = -INF;
  for (int i = n - 1; i >= 0; -- i){
    int p = lower_bound (all(v), -a[i] + x) - v.begin();
    //cout << i + 1 << " " << l[i] << " " << p << '\n';
    ans = max (ans, l[i] + p - 1);
    p = lower_bound (all(v), -a[i]) - v.begin();
    v[p] = -a[i];
  }
  cout << ans;
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

• 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