Pagini recente » Cod sursa (job #444160) | Cod sursa (job #701090) | Cod sursa (job #2734510) | Cod sursa (job #2879557) | Cod sursa (job #905958)
Cod sursa(job #905958)
#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 6000002
ifstream in("ssm.in");
ofstream out("ssm.out");
int S[NMAX];
int main()
{
unsigned int i, n, iimin;
int min = 0, imin = NMAX, imax = -1, tmp, bestSum = 0;
in >> n >> S[0];
for(i = 1; i < n; i++){
in >> tmp;
S[i] = S[i-1] + tmp;
}
for(i = 0; i < n; i++){
if(bestSum < S[i] - min){
bestSum = S[i] - min;
imax = i;
iimin = imin + 1;
}
if(min > S[i]){
min = S[i];
imin = i;
}
}
out << bestSum << " " << iimin + 1 <<" "<< imax + 1;
in.close();
return 0;
}