This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<homecoming.h>
using namespace std;
long long int C(int i,int j,int u,int *B){
int sum=0;
for(int k=j; k<=j+u-1; k++){
if(j==0) break;
if(k>=i){
sum-=B[k-1];
}
}
for(int k=i; k<=i+u-1; k++){
sum+=B[k-1];
}
return sum;
}
long long int solve(int N,int K,int *A,int *B){
int BB[10005];
for(int i=0; i<N; i++){
BB[i]=BB[i+N]=B[i];
}
long long int dp[10005]={0};
long long int mx=0;
for(int i=1; i<=N; i++){
for(int j=i-1; j>=0; j--){
dp[i]=max(dp[i],dp[j]+A[i-1]-C(i,j,K,BB));
mx=max(mx,dp[i]);
}
}
return mx;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |