Pagini recente » Cod sursa (job #2568554) | Cod sursa (job #1889976) | Razvy | Cod sursa (job #3138918) | Cod sursa (job #3166069)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000005],n,smax,s,st,dr,stfin,drfin;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
s=v[1],st=1;
for(int i=2; i<=n; i++)
{
smax=max(smax,s);
if(s+v[i]>v[i])
s+=v[i];
else
{
s=v[i];
st=i;
}
if(s>smax)
{
stfin=st;
drfin=i;
}
}
st=1;
for(int i=2; i<=n; i++)
{
if(s+v[i]>v[i])
s+=v[i];
else
{
s=v[i];
st=i;
}
if(s==smax)
{
stfin=st;
drfin=i;
fout<<smax<<" "<<stfin<<" "<<drfin;
return 0;
}
}
}