#ifndef __HOMECOMING_H
#define __HOMECOMING_H
#include <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;
const int NMAX = 2e6;
const int KMAX = 2e6;
int n;
long long dp[NMAX + 5][2];
long long prefA[NMAX + 5];
long long prefB[NMAX + 5];
long long prefdelta[NMAX + 5];
long long sum(int l,int r,long long pref[]){
if(l <= r){
return pref[r] - pref[l - 1];
}
return pref[n] - pref[l - 1] + pref[r];
}
long long solve(int N, int K, int *A, int *B){
n = N;
for(int i = 1;i <= N;i++){
prefA[i] = prefA[i - 1] + A[i];
prefB[i] = prefB[i - 1] + B[i];
prefdelta[i] = A[i] - B[i] + prefdelta[i - 1];
}
dp[1][1] = A[1] - sum(1,K,prefB);
long long mi = prefdelta[1],pos = 1;
for(int i = 2;i <= N;i++){
dp[i][0] = max(dp[i - 1][0],dp[pos][0] + A[i] + (-sum(i,(i + K - 2) % N + 1,prefB)) + (prefdelta[i - 1] - mi));
if(prefdelta[i] < mi){
mi = prefdelta[i];
pos = i;
}
}
for(int i = 1;i <= K;i++){
B[i] = 0;
}
for(int i = 1;i <= N;i++){
prefA[i] = prefA[i - 1] + A[i];
prefB[i] = prefB[i - 1] + B[i];
prefdelta[i] = A[i] - B[i] + prefdelta[i - 1];
}
mi = prefdelta[1];
pos = 1;
for(int i = 2;i <= N;i++){
dp[i][1] = max(dp[i - 1][1],dp[pos][1] + A[i] + (-sum(i,(i + K - 2) % N + 1,prefB)) + (prefdelta[i - 1] - mi));
if(prefdelta[i] < mi){
mi = prefdelta[i];
pos = i;
}
}
return max(dp[N][0],dp[N][1]);
}
int main() {
int T; assert(scanf("%d", &T) == 1);
for(int t = 0; t < T; t++) {
int N, K; assert(scanf("%d%d", &N, &K) == 2);
int *A = new int[N + 1];
int *B = new int[N + 1];
for(int i = 1; i <= N; i++) assert(scanf("%d", &A[i]) == 1);
for(int i = 1; i <= N; i++) assert(scanf("%d", &B[i]) == 1);
printf("%lld\n", solve(N, K, A, B));
delete[] A;
delete[] B;
}
return 0;
}
#endif
Compilation message
/tmp/ccMFj1r2.o: In function `main':
homecoming.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccWJnKCq.o:grader.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
