Submission #652176

#	Time	Username	Problem	Language	Result	Execution time	Memory
652176		pauloamed	Global Warming (CEOI18_glo)	C++14	100 / 100	44 ms	4140 KiB

glo

#include<bits/stdc++.h>
using namespace std;

const int MAXN = 200010;

int N, X;
int v[MAXN];

int main(){
  cin.tie(NULL)->sync_with_stdio(false);
  cin >> N >> X;
  for(int i = 0; i < N; ++i) cin >> v[i];

  vector<pair<int,int>> lis;
  // first: sem X
  // second: sem ou com X
  for(int i = 0; i < N; ++i){
    {
      auto it = lower_bound(lis.begin(), lis.end(), v[i]+X, 
        [](pair<int,int> el, int x){
          return x > min(el.first, el.second);
        }
      );
      if(it == lis.end()) lis.push_back({INT_MAX, v[i]+X});
      else it->second = v[i]+X;
    }

    {
      auto it = lower_bound(lis.begin(), lis.end(), v[i], 
        [](pair<int,int> el, int x){
          return x > el.first;
        }
      );
      it->first = v[i];
    }

    // for(int j = 0; j < lis.size(); ++j){
    //   cout << lis[j].first << " " << lis[j].second << " , ";
    // }
    // cout << "\n";
  }
  cout << lis.size() << "\n";
}

• 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