Cod sursa(job #611730)

Utilizator CBogdanCiobanu Bogdan CBogdan Data 2 septembrie 2011 21:42:45
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include<fstream>
#include<iostream>
using namespace std;

int N,i,minim,bestsol=-999999999,idx,beg,end,V[7000010];
ifstream in("ssm.in");
ofstream out("ssm.in");
void solve();

int main()
{
	solve();
	
	return 0;
}


void solve()
{
	in>>N;
	for(i=1;i<=N;i++)
	{
		in>>V[i];V[i]+=V[i-1];
		if(bestsol<V[i]-minim){bestsol=V[i]-minim;beg=idx+1;end=i;}
		if(minim>V[i])minim=V[i],idx=i;
	}
	out<<bestsol<<' '<<beg<<' '<<end;
}