Cod sursa(job #300349)
Utilizator | Zajzon Barna zbarni | Data | 7 aprilie 2009 13:18:09 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream.h>
#define nx 6000005
#define inf 1<<32
int a,best;
int sum=-inf;
int main()
{
ifstream be ("ssm.in");
ofstream ki ("ssm.out");
int n,w=1,e,v,i;
be>>n;
e=v=0;
for (i=1;i<=n;++i)
{
be>>a;
if (best<0)
{
w=i;
best=a;
}
else
best+=a;
if (best>sum)
{
sum=best;
e=w;
v=i;
}
}
be.close();
ki<<sum<<" "<<e<<" "<<v<<'\n';
ki.close();
return 0;
}