| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 152107 | HungAnhGoldIBO2020 | Homecoming (BOI18_homecoming) | C++14 | 0 ms | 0 KiB |
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<vector>
#include "homecoming.h"
#define int long long
using namespace std;
const int N=2e6+2;
const int inf=1e18+2;
int dp[N][2][2],sum[N],sum1[N]; //co chon khong , loai nao
long long solve(int n,int k,vector<int> A,vector<int> B){
int i,j;
for(i=0;i<B.size();i++){
sum[i]=B[i];
if(i){
sum[i]+=sum[i-1];
}
dp[i][0][0]=-inf;
dp[i][1][0]=-inf;
dp[i][0][1]=-inf;
dp[i][1][1]=-inf;
}
dp[0][0][0]=0;
dp[0][1][1]=A[0]-sum[k-1];
// cout<<dp[0][1][1]<<endl;
for(i=1;i<n;i++){
dp[i][0][0]=max(dp[i-1][0][0],dp[i-1][1][0]);
dp[i][0][1]=max(dp[i-1][0][1],dp[i-1][1][1]);
if(i+k-1<n){
dp[i][1][0]=min(dp[i-1][1][0]+A[i]-B[i+k-1],dp[i-1][0][0]+A[i]-(sum[i+k-1]-sum[i-1]));
dp[i][1][1]=max(dp[i-1][1][1]+A[i]-B[i+k-1],dp[i-1][0][1]+A[i]-sum[i+k-1]+sum[i-1]);
}
else{
dp[i][1][0]=min(dp[i-1][1][0]+A[i]-B[i+k-1-n],dp[i-1][0][0]+A[i]-sum[i+k-1-n]-sum[n-1]+sum[i-1]);
dp[i][1][1]=max(dp[i-1][1][1]+A[i],dp[i-1][0][1]+A[i]-sum[n-1]+sum[i-1]);
}
//cout<<dp[i][1][1]<<endl;
}
//cout<<dp[n-1][1][1]<<endl;
return max(max(dp[n-1][0][1],dp[n-1][1][0]),max(dp[n-1][1][1],dp[n-1][0][1]));
}
signed main(){
cout<<solve(3,2,{40,80,100},{140,0,20});
}