Pagini recente » Cod sursa (job #2536906) | Cod sursa (job #2888381) | Cod sursa (job #2063430) | Cod sursa (job #3149567) | Cod sursa (job #2577275)
#include <iostream>
#include <fstream>
using namespace std;
const int NMax = 6000000;
int v[NMax];
int T[NMax];
int main()
{ ifstream f("ssm.in");
ofstream g("ssm.out");
int n,start ,finish;
f>>n;
for(int i =1;i<= n;i++)
f>>v[i];
T[0] = -320000;
int maxim = T[0];
for(int i = 1;i<= n;i++){
if(T[i-1] + v[i]>v[i]){
T[i] = T[i-1] + v[i];
finish++;}
else {T[i] = v[i];
start = i;
finish = i;}
if(T[i] > maxim)
maxim = T[i];
}
finish--;
g << maxim << " " << start << " "<< finish;
return 0;
}