Задача 39269. Error

Given a sequence of N numbers. It is known that the sum of all numbers in the sequence does not exceed 10⁹. All its continuous subsequences are considered, in which the number of positive numbers is a multiple of K = 11. Find the largest sum of such a subsequence. 

Input
Given two input files (file A and file B), each containing in the first line, the number of numbers N (1 <= N <= 1,000,000). Each of the following N lines contains one number, modulo not exceeding 1000.

An example of the organization of source data in the input file (for K=3):
6
-1
2
3
-5
18
12

In this set, you can select the sequences -1+2+3+(-5)+18 (the sum of 17) and 3+(-5)+ 18+12 (sum 28). 
Answer(for K = 3): 28. 

Warning: do not use brute-force algorithm to process file B, which calculates the sum of all possible options, as the program written in such an algorithm will run too long.