Pagini recente » Cod sursa (job #2644219) | Cod sursa (job #922159) | Cod sursa (job #1850282) | Cod sursa (job #2244229) | Cod sursa (job #1811621)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long S[6000001],n,i,nr,mn=0,mx,kin=1,kfn,k;
int main()
{
mx=INT_MIN;
fin>>n;
S[0]=0;
for(i=1;i<=n;i++)
{
fin>>nr;
S[i]=S[i-1]+nr;
}
for(i=1;i<=n;i++)
{
if(S[i]-mn>mx)
{
mx=S[i]-mn;
k=kin;
kfn=i;
}
if(S[i]<mn)
{
mn=S[i];
kin=i+1;
}
}
fout<<mx<<" "<<k<<" "<<kfn<<endl;
return 0;
}