Pagini recente » Cod sursa (job #1272048) | Cod sursa (job #444771) | Cod sursa (job #2453674) | Cod sursa (job #570050) | Cod sursa (job #1699183)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream in("ssm.in");
ofstream out("ssm.out");
long n;
in>>n;
long elems[n+1];
elems[0] = 0;
for (long i = 1; i <= n; ++i) {
in>>elems[i];
}
long pozMin = 0, min = 0;
long currentSum = elems[1];
long end = 1;
long max = elems[1];
long start = 0;
for (long i = 2; i <= n; ++i) {
currentSum += elems[i];
long aux = currentSum - min;
if (aux < min) {
min = aux;
pozMin = i;
} else if (aux > max){
start = pozMin;
end = i;
max = aux;
}
}
out<<max<<" "<<start + 1<< " " <<end;
in.close();
out.close();
}