Cod sursa(job #549959)
| Utilizator | Data | 9 martie 2011 08:43:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
//subsir crescator maximal
#include<fstream.h>
ifstream q("ssm.in");
ofstream w("ssm.out");
int v[101],n,i,s,sm,p,u,j;
int main(){
q>>n;
for(i=1;i<=n;++i)
q>>v[i];
sm=v[1];
p=u=1;
for(i=1;i<=n;++i){
s=0;
j=i;
while(j<=n&&s+v[j]>0){
s=s+v[j];
if(s>sm){
sm=s;
p=i;
u=j;
}
++j;
}
}
w<<sm<<' '<<p<<' '<<u<<'\n';
w.close();
return 0;
}
