Pagini recente » Cod sursa (job #753630) | Arhiva de probleme | Cod sursa (job #2541489) | Cod sursa (job #1290939) | Cod sursa (job #2754554)
#include <fstream>
using namespace std;
int n,i,m,aux,j,k,l,maxim,p,maximi,maximj;
int v[6000002];
long long s[6000002];
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main () {
cin>>n;
for (i=1;i<=n;i++) {
cin>>v[i];
s[i]=s[i-1]+v[i];
}
j=1;
for (i=2;i<=n;i++) {
if (s[i]-s[j-1]>maxim) {
maxim=s[i]-s[j-1];
maximi=i;
maximj=j;
}
if(s[i]-s[j-1]<0){
j=i+1;
}
}
cout<<maxim<<" "<<maximj<<" "<<maximi;
}