Pagini recente » Cod sursa (job #1008536) | Cod sursa (job #700006) | Cod sursa (job #2101049) | Cod sursa (job #485048) | Cod sursa (job #1010031)
#include <iostream>
#define nmax 6000000
#define inf 1000000
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g ("ssm.out");
int i,n,inceputbun,numarbun,v[nmax],prev,k=0,inceput=1,max1=-inf,curr;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++){
if(v[i]+prev>=v[i]){
k++;
curr=v[i]+prev;
prev=curr;
}
else {
inceput=i;
curr=v[i];
prev=curr;
k=1;
}
if(max1<curr){
max1=curr;
inceputbun=inceput;
numarbun=k;
}
}
g<<max1<<" "<<inceputbun<<" "<<inceputbun+numarbun-1<<" ";
return 0;
}