Cod sursa(job #1701129)

Utilizator leopop29Pop Leonard leopop29 Data 12 mai 2016 10:57:57
Problema Secventa 2 Scor 40
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.52 kb
#include <iostream>
#include <fstream>
#define NM 50005

using namespace std;

int v[NM];

int main()
{
	ifstream f("secv2.in");
	ofstream g("secv2.out");
	int n, k;

	f >> n >> k;
	for(int i = 1; i <= n; ++i)
	{
		f >> v[i];
		v[i] += v[i-1];
	}

	int mn = v[1], cp = 1,  p = 1, mx = v[k]-v[p];
	int rx = 1, ry = k;

	for(int i = k+1; i <= n; ++i)
	{
		if(mn > v[++cp])
		{
			mn = v[cp];
			p = cp;
		}
		
		if(mx < v[i]-v[p])
		{
			rx = p+1;
			ry = i;
			mx = v[i]-v[p];
		}
	}

	g << rx << ' ' << ry << ' ' <<  mx << '\n';
}