Submission #384236

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
3842362021-03-31 20:37:57wind_reaperWatching (JOI13_watching)C++17
100 / 100
263 ms16108 KiB
#include <bits/stdc++.h>
using namespace std;
const int MXN = 2001;
int dp[MXN][MXN], a[MXN];
int n, p, q;
bool check(int w){
memset(dp, 0, sizeof dp);
for(int i = 1; i <= n; i++){
int l = 1, r = 1;
while(a[i] - a[l] >= w) l++;
while(a[i] - a[r] >= 2*w) r++;
for(int j = 0; j <= p; j++)
if(j == 0) dp[i][j] = dp[r-1][j] + 1;
else dp[i][j] = min(dp[l-1][j-1], dp[r-1][j] + 1);
}
return dp[n][p] <= q;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...