oj.uz

Submission #328699

# Submission time Handle Problem Language Result Execution time Memory
328699 2020-11-17T17:38:45 Z a_player Watching (JOI13_watching) C++14
0 / 100
 23 ms 8428 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int nax=2e3+3;
int n,p,q;
ll a[nax];
int dp[nax][nax];
bool check(ll w){
  for(int i=0;i<n;i++){
    int ppp=0;
    while(i-ppp>=0&&a[i]-w+1<a[i-ppp])ppp++;
    int pp=0;
    while(i-pp>=0&&a[i]-2*w+1<a[i-pp])pp++;
    for(int j=0;j<=q;j++){
      if(i==0&&j==0){
        dp[i][j]=1;
        continue;
      }

      if(i-ppp<0)dp[i][j]=1;
      else dp[i][j]=dp[i-ppp][j]+1;
      if(j!=0){
      if(i-pp<0)dp[i][j]=0;
      else dp[i][j]=min(dp[i][j],dp[i-pp][j-1]);
    }
    }
  }
  return dp[n-1][q]<=p;
}

int main(){
  cin>>n>>p>>q;
  if(p+q>=n){
    cout<<1<<endl;
    return 0;
  }
  for(int i=0;i<n;i++)cin>>a[i];
  ll x=-1;
  for(int b=1e9;b>=1;b/=2)
  while(!check(x+b))x+=b;
  cout<<x+1<<endl;
}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

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