Pagini recente » Cod sursa (job #2661472) | Cod sursa (job #845075) | Cod sursa (job #112905) | Cod sursa (job #484204) | Cod sursa (job #2909217)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
#define TOP 6000005
int element[TOP],n,topSum=INT_MIN,currentSum=0,position,startPosition,finalPosition;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> element[i];
}
for (int i = 0; i < n; i++) {
if (currentSum < 0) {
currentSum = element[i];
position = i;
}
else {
currentSum += element[i];
}
if (topSum < currentSum) {
topSum = currentSum;
startPosition = position;
finalPosition = i;
}
}
cout << topSum << " " << startPosition + 1 << " " << finalPosition + 1;
return 0;
}