Pagini recente » Cod sursa (job #936222) | Cod sursa (job #3319998) | Cod sursa (job #3339564) | Cod sursa (job #3338059) | Cod sursa (job #3309199)
//var dinamica
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[6000003], smax[6000003];
int main(){
int n;
fin >> n;
for (int i = 1; i <= n; i++){
fin >> v[i];
}
int best = 0, st, dr;
for (int i = 1; i <= n; i++){
smax[i] = max(v[i], smax[i - 1] + v[i]);
if (smax[i] == v[i])
st = i;
if (smax[i] > best){
best = smax[i];
dr = i;
}
best = max(best, smax[i]);
}
fout << best << " " << st << " " << dr;
return 0;
}