Pagini recente » Cod sursa (job #2701479) | Cod sursa (job #101870) | Cod sursa (job #3289572) | Cod sursa (job #64434) | Cod sursa (job #2909220)
#include<fstream>
#include<algorithm>
#include<limits.h>
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() {
int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> element[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;
}