题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
O(logn)
参考文献
C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
#include <deque>
#include <vector>
using namespace std;
const int N = 1e5+10;
long long a[N], b[N], s[N], t[N];
int main()
{
int n, k;
long long ans = 0;
cin >> n >> k;
for (int i = 0; i < n; i ++ ) cin>>a[i];
for (int i = 0; i < n; i ++ ) {
cin>>b[i];
s[i+1] = a[i] + s[i];
t[i+1] = t[i];
if (b[i]) t[i+1] += a[i];
}
for (int i = 0; i < n; i ++ ) {
if (i + k > n) break;
ans = max(ans, t[i] - s[i] + s[i + k] + t[n] - t[i + k]);
}
cout<<ans<<"\n";
return 0;
}