Pagini recente » Cod sursa (job #2466641) | Cod sursa (job #2436821) | Cod sursa (job #2038930) | Cod sursa (job #862168) | Cod sursa (job #2656740)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, Smax, St, Dr, smax, st, dr, smin, imin, v, sum;
int main()
{
f>>n;
Smax = 1<<31;
for(int i=1; i<=n; i++)
{
f>>v;
sum+=v;
smax=sum-smin;
st=imin;
dr=i;
if(smax > Smax)
{
Smax=smax;
St = st;
Dr = dr;
}
else if(smax==Smax)
if(make_pair(st,dr)<=make_pair(St,Dr))
St=st,Dr=dr;
if(sum<=smin)
{
smin=sum;
imin=i;
}
}
g<<Smax<<' '<<St+1<<' '<<Dr<<'\n';
return 0;
}