Cod sursa(job #451765)
Utilizator | Moldovan Liliana lily3 | Data | 9 mai 2010 22:01:14 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
long i,j,n,m,s[7000005],ic=1,sf=1,bestsum,s1,k;
long intx=1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
s1=s[1];
bestsum=s[1];
for(i=2;i<=n;i++)
{
if(s1<0)
s1=s[i],intx=i;
else
s1+=s[i];
if(bestsum<s1)
{
bestsum=s1;
ic=intx;;
sf=i;
}
}
g<<bestsum<<" "<<ic<<" "<<sf;
return 0;
}