Cod sursa(job #518327)
| Utilizator | Data | 31 decembrie 2010 10:04:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream.h>
#include<iostream.h>
long n,i,j=1,k=1,s=0,b=0,max=-1000,l=1;
int t;
int main()
{fstream f1("ssm.in",ios::in);
fstream f2("ssm.out",ios::out);
f1>>n;
for(i=1;i<=n;i++)
{f1>>t;
if(b>s)
{b=s;
l=i;}
s+=t;
if(max<s-b)
{max=s-b;
k=i;}
if(l<=k)
j=l;}
if(max<0)
j=k;
f2<<max<<" "<<j<<" "<<k;
f1.close();
f2.close();
return 0;}
