Cod sursa(job #2910723)

Utilizator Teodor11Posea Teodor Teodor11 Data 24 iunie 2022 18:22:24
Problema Secventa 2 Scor 70
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.54 kb
#include <iostream>
#include <fstream>
using namespace std;

int n, k, x, y, maxSum, s[50001];

int main() {
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
	fin >> n >> k;
	for (int i = 1; i <= n; ++i) {
		fin >> x;
		s[i] = s[i - 1] + x;
	}
	maxSum = -25001;
	for (int t = k ; t <= n; ++t) {
		for (int i = 1; i <= n - t + 1; ++i) {
			if (maxSum < s[i + t - 1] - s[i - 1]) {
				maxSum = s[i + t - 1] - s[i - 1];
				x = i;
				y = i + t - 1;
			}
		}
	}
	fout << x << ' ' << y << ' ' << maxSum;
	return 0;
}