제출 #920446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
920446		KaleemRazaSyed	Global Warming (CEOI18_glo)	C++17	100 / 100	152 ms	8640 KiB

glo

#include<bits/stdc++.h>
 
using namespace std;
 
const int N = 2e5+5;
int a[N], b[N], n;
int ft[2][2 * N];
 
void update(int i, int x, int val)
{
  while(x < 2 * N)
    {
      ft[i][x] = max(ft[i][x], val);
      x += (x & (-x));
    }
}
int query(int i, int x)
{
  int ans = 0;
  while(x > 0)
    {
      ans = max(ans, ft[i][x]);
      x -= (x & (-x));
    }
  return ans;
}
 
int compute()
{
  vector<int> v;
  for(int i = 0; i < n; i ++)
    v.push_back(b[i]), v.push_back(a[i]);
 
  sort(v.begin(), v.end());
  v.resize(unique(v.begin(), v.end()) - v.begin());
 
  for(int i = 0; i < n; i ++)
    b[i] = lower_bound(v.begin(), v.end(), b[i]) - v.begin() + 1;
 
  for(int i = 0; i < n; i ++)
    a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin() + 1;
  
  int ans = 1;
  for(int i = 0; i < n; i ++)
    {
      int x = query(1, a[i] - 1) + 1;
      ans = max(x, ans);
 
      int y = query(0, a[i] - 1) + 1;
      ans = max(y, ans);
      update(0, a[i], y);
      
      update(1, a[i], x);
      update(1, b[i], y);
    }
  return ans;
}
 
int main()
{
  int x;
  cin >> n >> x;
  for(int i = 0; i < n; i ++)
    {
      cin >> a[i];
      b[i] = a[i] - x;
    }
  cout << compute() << endl;
  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