제출 #788782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788782		Desh03	Financial Report (JOI21_financial)	C++17	19 / 100	3226 ms	300604 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
 
struct Fenwick {
  vector<multiset<int>> F;
  int n;
  Fenwick(int n_) : n(n_) {
    F.resize(n);
  }
  void remove(int x, int d) {
    for (; x < n; x |= x + 1) F[x].erase(F[x].find(d));
  }
  void add(int x, int d) {
    for (; x < n; x |= x + 1) F[x].insert(d);
  }
  int qry(int x) {
    int s = 0;
    for (; x >= 0; x = (x & (x + 1)) - 1) 
      if (F[x].size()) s = max(s, *F[x].rbegin());
    return s;
  }
};
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, d;
  cin >> n >> d;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> v = a;
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  for (int &x : a) x = lower_bound(v.begin(), v.end(), x) - v.begin();
  Fenwick fen(n);
  vector<int> dp(n);
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
  multiset<int> st;
  for (int i = 0; i < n; i++) {
    st.insert(a[i]);
    int mn = *st.begin();
    while (pq.size()) {
      auto [x, y] = pq.top();
      if (mn > x) {
        fen.remove(x, y);
        pq.pop();
      } else break;
    }
    dp[i] = fen.qry(a[i] - 1) + 1;
    fen.add(a[i], dp[i]);
    if (i >= d) {
      pq.push({a[i - d], dp[i - d]});
      st.erase(st.find(a[i - d]));
    }
  }
  cout << *max_element(dp.begin(), dp.end()) << '\n';
  return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 5 / 5
• Subtask 6: 0 / 35