Pagini recente » Cod sursa (job #1586519) | Cod sursa (job #938239) | Cod sursa (job #62848) | fmi-no-stress-2012/solutii/berarii2 | Cod sursa (job #1574311)
#include <iostream>
#include <fstream>
#define NMax 7000005
std::ifstream fin("ssm.in");
std::ofstream fout("ssm.out");
int n, a[NMax];
int beginIndex, endIndex, bestSum = -int(2e9), sum = 0, idx;
int main(int argc, char *argv[]){
fin >> n;
for (int i = 0; i < n; i++)
fin >> a[i];
for (int i = 0; i < n; i++){
if (sum < 0)
sum = a[i], idx = i;
else
sum += a[i];
if (bestSum < sum)
bestSum = sum, beginIndex = idx, endIndex = i;
}
fout << bestSum << " " << beginIndex + 1 << " " << endIndex + 1;
return 0;
}