Pagini recente » Cod sursa (job #3340861) | Cod sursa (job #3318124) | Cod sursa (job #3313883) | Cod sursa (job #3201562) | Cod sursa (job #2183604)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,v[6000001],BestI,m,Bst,Bdr,st,dr;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
}
m=INT_MIN;
Bst=1;
Bdr=1;
for(i=1;i<=n;i++){
///BestI=max(BestI+v[i],v[i]);
if(BestI+v[i]>v[i]){
Bdr++;
BestI+=v[i];
}else{
BestI=v[i];
Bst=i;
Bdr=i;
}
if(BestI>m){
m=BestI;
st=Bst;
dr=Bdr;
}
}
fout<<m<<" "<<st<<" "<<dr;
return 0;
}