class Solution:
def solve(self, theorms, awake, n, k):
i, j = 0, 0
onesSum = 0
for i in range(n):
if awake[i]:
onesSum += theorms[i]
theorms[i] = 0
localSum = sum(theorms[:k])
maxSum = localSum
for i in range(1, n):
if i < n - k + 1:
localSum += (theorms[i + k - 1] - theorms[i - 1])
else:
localSum -= theorms[i - 1]
maxSum = max(maxSum, localSum)
print(maxSum + onesSum)
return
def main():
t = 1
sol = Solution()
while t:
n, k = list(map(int, input().strip().split()))
theorms = list(map(int, input().strip().split()))
awake = list(map(int, input().strip().split()))
sol.solve(theorms, awake, n, k)
t -= 1
if __name__ == '__main__':
main()#include <iostream>
using namespace std;
int main() {
long long a[100008], t[100008], x, n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
int sun = 0, sum = 0;
for (int i = 1; i <= n; i++) {
cin >> t[i];
if (t[i])
x += a[i];
else
sum += a[i];
if (i - k > 0 && t[i - k] == 0)
sum -= a[i - k];
sun = max(sum, sun);
}
cout << x + sun << endl;
}
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |