Pagini recente » Cod sursa (job #2129542) | Istoria paginii runda/oji_2013 | Cod sursa (job #2032601) | Cod sursa (job #1053801) | Cod sursa (job #2345750)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int main()
{
int S,i,n,bestsum=-int(2e9),sum=0,ind,first,last;
in>>n;
for (i=1;i<=n;i++)
{
in>>S;
if (sum<0)
{
sum=S;
ind=i;
}
else
sum=sum+S;
if (bestsum<sum)
{
bestsum=sum;
first=ind;
last=i;
}
}
out<<bestsum<<" "<<first<<" "<<last;
return 0;
}