Cod sursa(job #1472818)
Utilizator | Data | 17 august 2015 20:02:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
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 max1,st,dr,p,u,i,n,a[6000001],s;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
p=u=1;
max1=a[1];
st=dr=1;
s=a[1];
for(i=2;i<=n;i++)
{
if(s<0)
{
p=i;
u=i;
s=a[i];
}
else
{
s+=a[i];
u=i;
}
if(s>max1)
{
max1=s;
st=p;
dr=u;
}
}
g<<max1<<" "<<st<<" "<<dr;
return 0;
}