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