Pagini recente » Clasament pregoni3 | Cod sursa (job #508303) | Cod sursa (job #2928888) | Cod sursa (job #1503300) | Cod sursa (job #1598317)
#include <iostream>
#include <fstream>
using namespace std;
int N, vec[100000] = {0};
//int S[100000] = {0};
int main()
{
ifstream f("ssm.in");
ofstream o("ssm.out");
f >> N;
for(int i = 1; i <= N; i++)
f >> vec[i];
int sum = 0, start = 1, bestSum = 0, my_start = 0, my_end = 0;
for(int i = 1; i <= N; i++)
{
if(sum < 0)
{
sum = vec[i];
start = i;
}
else
sum += vec[i];
if(bestSum < sum)
{
bestSum = sum;
my_start = start;
my_end = i;
}
}
o << bestSum << " " << my_start << " " << my_end;
f.close();
o.close();
return 0;
}