Pagini recente » preONI 2005 runda #2 - solutii | Cod sursa (job #607531) | Monitorul de evaluare | lol_contest_02 | Cod sursa (job #1589096)
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,x[6000001];
int main()
{
int maxx,s=0,dr=1,st=1,i,poz;
in>>n;
maxx=0;
for(i=1;i<=n;i++)
in>>x[i];
maxx=x[1];
s=x[1];
st=1;
poz=1;
dr=1;
for(i=2;i<=n;i++)
{
s=s+x[i];
if(s>maxx)
{
maxx=s;
st=poz;
dr=i;
}
if(s<0)
{
s=0;
poz=i+1;
}
}
out<<maxx<<" "<<st<<" "<<dr;
return 0;
}