Pagini recente » Cod sursa (job #351216) | Cod sursa (job #1744336) | Cod sursa (job #464674) | Cod sursa (job #126174) | Cod sursa (job #1497087)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream gout("ssm.out");
int n,*v;
fin>>n;
v = new int[n];
for(int i=0;i<n;++i)
fin>>v[i];
int bestSum = -1111111;
int idx = 0, minim = 0, first , last;
for(int i=1;i<n;++i)
{
v[i]+=v[i-1];
if(bestSum < v[i] - minim)
{
bestSum = v[i] - minim;
first = idx + 1;
last = i;
}
if(v[i] < minim)
{
minim = v[i];
idx = i;
}
}
gout<<bestSum<<" "<<first+1<<" "<<last+1;
return 0;
}