Submission #465049

#	Time	Username	Problem	Language	Result	Execution time	Memory
465049		deinfreund	Global Warming (CEOI18_glo)	C++14	27 / 100	321 ms	13564 KiB

glo

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n, num, d;
  cin >> n >> d;
  map<int, int> blub, fred;
  blub[-d] = fred[-d] = 0;
  for (int i = 0; i < n; i++) {
    cin >> num;
    blub[num] = prev(blub.lower_bound(num))->second + 1;
    fred[num] = max(fred[num], max(prev(blub.lower_bound(num + d))->second + 1, prev(fred.lower_bound(num))->second + 1));
    auto it = blub.find(num);
    int val = it->second;
    auto nextit = next(it);
    while(nextit != blub.end() && nextit->second < val) {
      blub.erase(nextit);
      nextit = next(blub.find(num));
    }
    {
      auto it = fred.find(num);
      int val = it->second;
      auto nextit = next(it);
      while(nextit != fred.end() && nextit->second < val) {
	fred.erase(nextit);
	nextit = next(fred.find(num));
      }
    }
  }
  cout << fred.rbegin()->second << "\n";
}

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