Cod sursa(job #1357941)
| Utilizator | Data | 24 februarie 2015 11:15:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#define VM 6000001
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
f>>n;
int SumaCurenta, rez = 0;
long long suma = -VM;
int indice;
int inceput, sfarsit;
for(int i = 1 ; i <= n ; ++i){
int a;
f>>a;
SumaCurenta = max(rez + a , a);
if(rez + a < a){
indice = i;
}
if(SumaCurenta > suma){
suma = SumaCurenta;
inceput = indice;
sfarsit = i;
}
rez = SumaCurenta;
}
g<<suma<<' '<<inceput<<' '<<sfarsit;
return 0;
}
