Pagini recente » Cod sursa (job #1817089) | Cod sursa (job #1164463) | Cod sursa (job #30877) | Cod sursa (job #2038118) | Cod sursa (job #3032241)
#include <iostream>
#include <fstream>
#include <algorithm>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++ i)
#define Max(a, b) ((a) > (b) ? (a) : (b))
using namespace std;
ifstream f(".in");
ofstream g(".out");
const int MAXN = 7000005;
int main() {
int n,S;
int bestSum=-int(2e9),sum=0,beg,End,idx;
f>>n;
FOR(i,1,n) {
f>>S;
if(sum<0){
sum=S;
idx=i;
}
else
sum+=S;
if(bestSum<sum){
bestSum=sum;
beg=idx;
End=i;
}
}
g<<bestSum<<" "<<beg<<" "<<End;
return 0;
}