Cod sursa(job #1022596)
Utilizator | Data | 5 noiembrie 2013 19:30:40 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream d("ssm.in");
ofstream o("ssm.out");
int a,i,j,k,n,s,smax=-2000000000,imax=0,jmax=0;
int main()
{
d>>n;
s=0;
j=1;
for(i=1;i<=n;i++){
d>>a;
if(s<0){
s=0;
j=i;
}
s+=a;
if(s>smax){
smax=s;
imax=j;
jmax=i;
}
}
o<<smax<<' '<<imax<<' '<<jmax;
return 0;
}