Cod sursa(job #2674464)

Utilizator teofilotopeniTeofil teofilotopeni Data 19 noiembrie 2020 11:18:28
Problema Secventa 2 Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.53 kb
#include <iostream>
#include <fstream>
using namespace std;

// Secv2

int main() {
	freopen("secv2.in", "r", stdin);
	freopen("secv2.out", "w", stdout);

	int n, m, i, j, v[50010] = { 0 };
	scanf_s("%d %d %d", &n, &m, &v[1]);
	int maxim = 1, sm = 1, fm = 1;
	for (i = 2; i <= n; i++) {
		scanf_s("%d", &v[i]);
		v[i] += v[i - 1];
		for (j = 1; j <= i - m; j++) {
			if (v[i] - v[j - 1] > maxim) {
				maxim = v[i] - v[j - 1];
				sm = j;
				fm = i;
			}
		}
	}
	printf("%d %d %d", sm, fm, maxim);
	return 0;
}