oj.uz

Submission #908633

# Submission time Handle Problem Language Result Execution time Memory
908633 2024-01-16T15:40:15 Z Trisanu_Das Financial Report (JOI21_financial) C++17
0 / 100
 4000 ms 5972 KB 
#include <bits/stdc++.h>
using namespace std;
 
int n, d, a[300005], memo[300005];
 
int dp(int i){
  if(i == n) return 1;
  if(memo[i] != -1) return memo[i];
  memo[i] = 0; int l = i;
  for(int j = i + 1; j - l <= d && j <= n; j++){
    if(a[j] <= a[i]) l = j;
    else memo[i] = max(memo[i], dp(j));
  }
  memo[i]++;
  return memo[i];
}
 
int main(){
  ios_base::sync_with_stdio(false); cin.tie(NULL);
  cin >> n >> d;
  for(int i = 1; i <= n; i++) cin >> a[i];
  memset(memo, -1, sizeof(memo));
  int ans = 0;
  for(int i = 0; i <= n; i++) ans = max(ans, dp(i));
  cout << ans << '\n';
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4102 ms 5688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4089 ms 5972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -