Cod sursa(job #2034035)

Utilizator andreigasparoviciAndrei Gasparovici andreigasparovici Data 7 octombrie 2017 13:18:11
Problema Secventa 2 Scor 40
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.64 kb
#include <bits/stdc++.h>
using namespace std;

#define NMAX 50005

int n, k, a[NMAX], s[NMAX];

void citire() {
	scanf("%d %d ", &n, &k);
	for(int i = 1; i <= n; i++) {
		scanf("%d ", &a[i]);
		s[i] = s[i - 1] + a[i];
	}
}

int maxim, minim, pmax, pmin;

void rezolvare() {
	maxim = s[k], pmax = k, minim = 0;

	for(int i = 1; i <= n; i++) {
		if(maxim < s[i + k] - minim) {
			maxim = s[i + k] - minim;
			pmax = i + k;
		}

		if(minim > s[i]) {
			minim = s[i];
			pmin = i + 1;
		}
	}

	printf("%d %d %d\n", pmin, pmax, maxim);
}

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

	citire();
	rezolvare();

	return 0;
}