Cod sursa(job #2404921)
Utilizator | Data | 13 aprilie 2019 16:21:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int Nmax = 6000005;
const int inf = (1 << 30);
int v[Nmax],n;
int sum;
int hi, lo;
int bestsum = -inf;
int beg;
int main(){
int i;
f >> n;
for ( i = 1 ; i <= n ; i++)
f >> v[i];
for( i = 1 ; i <= n; i++){
if(sum < 0)
sum = v[i] , beg = i;
else
sum += v[i];
if(bestsum < sum){
bestsum = sum;
lo = beg;
hi = i;
}
}
g << bestsum << " " << lo << " " << hi;
return 0;
}