Pagini recente » Cod sursa (job #3278455) | Cod sursa (job #468511) | Cod sursa (job #2002412) | Cod sursa (job #310695) | Cod sursa (job #1256030)
#include<fstream>
#include<algorithm>
#define LL long long
#define MAXN 60000001
using namespace std;
LL N,S[MAXN];
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main() {
LL i,j,min,best,nr,st,dr;
cin>>N;
for(i=1;i<=N;i++) {
cin>>nr;
S[i]=S[i-1]+nr; }
min=S[1],best=S[1],st=1,dr=1;
for(i=1;i<=N;i++) {
if (best<S[i]-min) {
best=S[i]-min;
st=j+1;
dr=i; }
if(S[i]<min){
min=S[i];
j=i; }
}
cout<<best<<" "<<st<<" "<<dr;
return 0;
}