Submission #958714

#	Time	Username	Problem	Language	Result	Execution time	Memory
958714		aeg	Homecoming (BOI18_homecoming)	C++14	0 / 100	29 ms	17792 KiB

homecoming

#include <bits/stdc++.h>
#include "homecoming.h"

using namespace std;

long long solve(int n, int k, int *a, int *b){
	int64_t ret = 0;
	int64_t maxi, cur, cost, nextcost;
	for(int it = 1; it <= 2; it++){
		cost = accumulate(b, b + k, 0ll);
		cur = a[0] - cost;
		maxi = (it == 1 ? INT64_MIN : 0);
		maxi = max(maxi, cur);
		for(int i = 1; i < n; i++){
			if(it == 2) nextcost = b[i + k - 1 - n];
			else if(i + k - 1 < n) nextcost = b[i + k - 1];
			else nextcost = 0;
			cost -= b[i - 1];
			cur = max(a[i] + cur - nextcost, a[i] - (cost + nextcost) + maxi);
			cost += nextcost;
			maxi = max(maxi, cur);
		}
		ret = max(maxi, ret);
	}
	return ret;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 18
• Subtask 3: 0 / 31
• Subtask 4: 0 / 38