Pagini recente » Cod sursa (job #654870) | Cod sursa (job #959766) | Cod sursa (job #670259) | Cod sursa (job #1782386) | Cod sursa (job #2110485)
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#define mm 6000002
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long sum[mm];
long long minn, best, smax = -1000000;
int main()
{
int n, x;
int st, dr;
fin >> n;
for( int i = 1 ; i <= n ; ++i ){
fin >> x;
sum[i] = sum[i-1] + x;
}
minn = sum[0];
for( int i = 1 ; i <= n ; ++i ){
best = sum[i] - minn;
if( sum[i] < minn ){
minn = sum[i];
st = i + 1;
}
if( best > smax ){
smax = best;
dr = i;
}
}
fout << smax << " " << st << " " << dr;
return 0;
}