Cod sursa(job #910922)
Utilizator | Ionescu Teodor teoionescu | Data | 11 martie 2013 10:35:13 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,aux,sc,poz=1,l=0,scmax=-(1<<30),pozmax,lmax;
int main(){
in>>n>>aux;
sc=aux;
for(int i=1;i<=n;i++){
if(sc<0){
sc=0;
poz=i+1;
l=0;
}
in>>aux;
sc+=aux;
l++;
if(sc>scmax){
scmax=sc;
pozmax=poz;
lmax=l;
}
}
out<<scmax<<' '<<pozmax<<' '<<pozmax+lmax-1;
return 0;
}