Cod sursa(job #901588)
Utilizator | Dandelion paul_danut | Data | 1 martie 2013 10:53:32 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
long int i,min,j,in,sf,n,bs=0,x,sum=0;
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(sum<0&&x>sum)
{sum=x;
j=i;}
else
sum+=x;
if(bs<sum)
{in=j;
bs=sum;
sf=i;}
}
g<<bs<<' '<<in<<' '<<sf;
f.close();g.close();
}