Cod sursa(job #1004369)
Utilizator | Data | 2 octombrie 2013 17:26:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,incep,Max,Max1,Max2,s,x,n;
int main()
{
f>>n>>x;Max1=Max2=1;Max=x;s=0;incep=1;
for(i=2;i<=n;++i)
{
f>>x;
if(s<0) {s=0;incep=i;}
s+=x;
if(s>Max) {Max1=incep;Max2=i;Max=s;}
}
g<<Max<<" "<<Max1<<" "<<Max2<<'\n';
return 0;
}