Cod sursa(job #1522211)
| Utilizator | Data | 11 noiembrie 2015 13:23:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 45 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<iostream>
#include<fstream>
using namespace std;
long int N;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>N;
int v[600006];
int u;
int min;
int max;
int start;
int end;
int S, i, k1;
f>>v[1];
S = 0;
min = v[1];
max = -60000;
for(i = 2 ; i <= N ; i++)
{f>>v[i];
S = S + v[i-1];
if (S < min)
{min = S;
start = i;
}
u = S + v[i] - min;
if( u > max )
{
max = u;
end = i;
}
}
g<<max<<" "<<start<<" "<<end<<endl;
return 0;
}
