Cod sursa(job #2198767)
| Utilizator | Data | 25 aprilie 2018 12:44:09 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,j,n,k,Max,v[100001],sol[100001],l[100001],p;
int main()
{ f>>n;
for(i=1;i<=n;i++){
f>>v[i];
l[i]=1;
for(j=i-1;j>=1;j--){
if(v[j]<v[i])
if(l[i]<l[j]+1){
l[i]=l[j]+1;
if(Max<l[i]){
Max=l[i];
p=i;
}
}
}
}
k=Max;
sol[Max]=v[p];
Max--;
for(i=p;i>=1&&Max>0;i--)
if(l[i]+1==l[p]){
sol[Max]=v[i];
p=i;
Max--;
}
g<<k<<'\n';
for(i=1;i<=k;i++)
g<<sol[i]<<' ';
return 0;
}
