제출 #1035271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1035271		May27_th	Financial Report (JOI21_financial)	C++17	12 / 100	43 ms	9048 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define i64 long long
#define mp make_pair
#define all(x) (x).begin(), (x).end()
const int MAXN = 300005;
const int INF = 1e9 + 7;
int N, D, a[MAXN], f[MAXN], r[MAXN], from[MAXN];
int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cin >> N >> D;
  for (int i = 1; i <= N; i ++) cin >> a[i];
  stack<int> s; s.push(N + 1); a[N + 1] = INF, r[N + 1] = N + 1, from[N + 1] = N + 1;  
  int ans = 0;
  for (int i = N; i >= 1; i --) {
    while (!s.empty() && a[s.top()] <= a[i]) s.pop();
    r[i] = s.top();
    int greater = 1;
    f[i] = f[s.top()] + 1;
    from[i] = s.top();
    for (int j = s.top() + 1; j <= N + 1; j ++) {
      if (greater >= D) break;
      if (a[j] > a[i]) {
        if (f[j] + 1 > f[i]) {
          from[i] = j;
          f[i] = f[j] + 1;
        }
      }
      else greater = 0;
      greater += (a[j] > a[i]);
      j = from[j];
    }
    ans = max(ans, f[i]);
    s.push(i);
    // cout << i << " " << from[i] << " " << f[i] << "\n";
  }
  cout << ans << "\n";
}

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