Cod sursa(job #824972)
Utilizator | Data | 27 noiembrie 2012 11:29:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
//Fron George SSM
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, j, numar, st, dr, inter;
int s=0, maxim=-6900000;
int main(){
f>>n;
for(j=1;j<=n;j++){
f>>numar;
if(s<0){s=0; inter=j;} s+=numar;
if(s>maxim){st=inter;dr=j;maxim=s;}}
g<<maxim<<' '<<st<<' '<<dr<<'\n';
return 0;}