Cod sursa(job #264993)
Utilizator | Data | 23 februarie 2009 09:09:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
void main()
{
int bestsum=-32000,sum=0,end,beg,ind,i,s[100],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;
}