Cod sursa(job #1789185)
Utilizator | Data | 26 octombrie 2016 19:21:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<algorithm>
using namespace std;
int dr,nrmaxi,st,i,n,k,t,j,x[100005],a,nr,p,Smaxi;
long long s;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
cin>>x[i];
Smaxi=x[1];
s=x[1];
st=1;
dr=1;
for(i=2;i<=n;i++)
{
if(s+x[i]>x[i])
s=s+x[i];
else
{
s=x[i];
st=i;
}
if(s>Smaxi)
{
Smaxi=s;
dr=i;
}
}
cout<<Smaxi<<" "<<st<<" "<<dr;
return 0;
}