Pagini recente » Cod sursa (job #2442881) | Cod sursa (job #2449144) | Cod sursa (job #2456777) | Cod sursa (job #1177492) | Cod sursa (job #2470774)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX = 7000005;
long long int n, s[NMAX], i;
int main(){
long long int sum = 0, bestSum = -int(2e9), beg, end, idx;
fin >> n;
for(i = 1; i <= n; ++i)
fin >> s[i];
for(i = 1; i <= n; ++i)
{
if(sum < 0)
sum = s[i], idx = i;
else
sum += s[i];
if(bestSum < sum) bestSum = sum, end = i, beg = idx;
}
fout << bestSum << ' ' << beg << ' ' << end;
fin.close();
fout.close();
return 0;
}