Cod sursa(job #1646652)
Utilizator | Data | 10 martie 2016 17:04:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000005],st,dr,max1,p,s,i;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
s=a[1];
p=1;
max1=a[1];
st=1;
dr=1;
for(i=2;i<=n;i++)
{
if(s<0)
{
s=a[i];
p=i;
}
else
{
s+=a[i];
if(s>max1)
{
max1=s;
st=p;
dr=i;
}
}
}
g<<max1<<" "<<st<<" "<<dr;
return 0;
}