Pagini recente » Cod sursa (job #489644) | Cod sursa (job #1537784) | Cod sursa (job #1575493) | Cod sursa (job #2314425) | Cod sursa (job #2494790)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000002];
int bMax[6000002];
int main(){
int n;
in>>n;
for(int i = 1; i <= n; i++){
in>>v[i];
}
int iD = 1, jD = 1;
int sum = 0;
int bestSum = -2000000000;
for(int i = 1; i <= n; i++){
sum += v[i];
if(sum < 0){
sum = 0;
iD = i + 1;
}
else if(sum > bestSum){
bestSum = sum;
jD = i;
}
}
out<<bestSum<<" "<<iD<<" "<<jD;
return 0;
}