Pagini recente » Borderou de evaluare (job #1002893) | Cod sursa (job #1028859) | Cod sursa (job #2305567) | Cod sursa (job #1955707) | Cod sursa (job #2147522)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm1.in");
ofstream g("ssm1.out");
const int M = 7000005;
int a[M], n, i;
int main(void) {
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
int bestSum = -int(2e9), sum = 0, beg, end, idx;
for (i = 1; i <= n; i++)
{
if (sum < 0)
sum = a[i], idx = i;
else
sum += a[i];
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
g << bestSum << " " << beg << " " << end;
return 0;
}