Pagini recente » Istoria paginii runda/becreative9 | Cod sursa (job #1101773) | Istoria paginii runda/cevaproblemeoji/clasament | Cod sursa (job #1095171) | Cod sursa (job #2510322)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,st,dr,x,smax,s,dr1,st1;
int main (){
fin>>n;
st=1;
for(i=1;i<=n;i++){
fin>>x;
if(s<0){
s=x;
st=i;
dr=i;
}
else
{
s=s+x;
dr=i;
}
if(smax<s)
{
smax=s;
dr1=dr;
st1=st;
}
}
fout<<smax<<" "<<st1<<" "<<dr1;
return 0;
}