Cod sursa(job #878212)
| Utilizator | Data | 14 februarie 2013 09:54:58 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
//Sa se gaseasca un subsir se suma maxima din secventa
#include<fstream.h>
ifstream f("secv.in");
ofstream g("secv.out");
int n,a[200000],d[200000],max,pmax,i,j,vmax,v[200000],maxp;
int main()
{ f>>n;
for(i=1;i<=n;i++) f>>v[i];
a[1]=v[1];
d[1]=0;
for(i=2;i<=n;i++)
{ max=0;
pmax=0;
for(j=1;j<=i-2;j++) if(a[j]>max) { max=a[j];
pmax=j;
}
a[i]=v[i]+max;
d[i]=pmax;
if(a[i]>vmax) { vmax=a[i];
maxp=pmax;
}
}
g<<vmax<<" ";
f.close();
g.close();
return 0;
}
