# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
578770 | 2022-06-17T23:00:13 Z | AlperenT | Homecoming (BOI18_homecoming) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "homecoming.h" using namespace std; const long long INF = 1e18; long long solve(int n, int k, vector<int> a, vector<int> b){ long long ans = 0; long long mx, cur, cost, nxtcost; for(int it = 1; it <= 2; it++){ mx = (it == 1 ? -INF : 0); cost = accumulate(b.begin(), b.begin() + k, 0ll); cur = a[0] - cost; mx = max(mx, cur); for(int i = 1; i < n; i++){ cost -= b[i - 1]; if(i + k - 1 < n) nxtcost = b[i + k - 1]; else if(it == 2) nxtcost = b[i + k - 1 - n]; cur = max(a[i] + cur - nxtcost, a[i] - (cost + nxtcost) + mx); cost += nxtcost; mx = max(mx, cur); } ans = max(ans, mx); } return ans; }