Pagini recente » Cod sursa (job #1076837) | Cod sursa (job #1702555) | Cod sursa (job #138415) | Cod sursa (job #2146632) | Cod sursa (job #474162)
Cod sursa(job #474162)
#include<iostream>
#include<fstream>
using namespace std;
int S[6000001];
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n;
in>>n;
for(int i=1;i<=n;i++)
in>>S[i];
S[0]=0;
int min,best=-int(2e9),ind=0,beg,end;
for(int i=2;i<=n;i++){
S[i]+=S[i-1];
if(best<S[i]-min)
best=S[i]-min,beg=ind+1,end=i;
if(min>S[i])
min=S[i],ind=i;
}
out << best << " "<< beg << " " <<end;
return 0;
}