Cod sursa(job #1547233)
| Utilizator | Data | 9 decembrie 2015 09:39:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define nmax 6000005
using namespace std;
int n, S[nmax], best = -(1<<31), sum = 0, st, fin, it;
void read(){
ifstream f("ssm.in");
f >> n;
for(int i=1; i<=n; i++)
f >> S[i];
}
int main()
{
read();
for(int i=1; i<=n; i++){
if(sum < 0){
sum = S[i];
it = i;
}
else
sum += S[i];
if(best < sum){
best = sum;
st = i;
fin = it;
}
}
ofstream g("ssm.out");
g << best << " " << st << " " << fin;
return 0;
}
