Pagini recente » Cod sursa (job #2473586) | Cod sursa (job #2597508) | Monitorul de evaluare | Cod sursa (job #2567563) | Cod sursa (job #2470657)
#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 min = 0, bestSum = -int(2e9), beg, end;
fin >> n;
for(i = 1; i <= n; ++i)
fin >> s[i];
for(i = 1; i <= n; ++i)
{
s[i] += s[i - 1];
if(bestSum < s[i] - min) bestSum = s[i] - min, end = i;
if(min > s[i]) min = s[i], beg = i + 1;
}
fout << bestSum << ' ' << beg << ' ' << end;
fin.close();
fout.close();
return 0;
}