Cod sursa(job #265001)
| Utilizator |  Radu Lucian Andrei frumushel |
Data | 23 februarie 2009 09:18:12 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
int main()
{
long long bestsum=-32000,sum=0,end,beg,ind,i,s[1600],n;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
for(i=1;i<=n;i++)
{
if(sum<0){sum=s[i];ind=i;}
else sum+=s[i];
if(bestsum<sum){beg=ind;end=i;bestsum=sum;}
}
g<<bestsum<<" "<<beg<<" "<<end;
return 0;
}