Pagini recente » Cod sursa (job #484067) | Cod sursa (job #1510444) | Cod sursa (job #1797640) | Istoria paginii runda/un_concurs_ce_concurs | Cod sursa (job #658643)
Cod sursa(job #658643)
#include <fstream>
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int n,p,mx_element;
int a[100088], best[100088], poz[100088];
void PD (){
int i, j;
best[n]=1; poz[n]=-1; p=n; mx_element=1;
for (i=n-1;i>=1;i--){
best[i]=1;
poz[i]=-1;
for (j=i+1;j<=n;j++){
if(a[j]>a[i] && best[i]<best[j]+1){
best[i]=best[j]+1;
poz[i]=j;
if(best[i] > mx_element) mx_element=best[i],p=i;
}
}
}
}
void PRINT_DATA (){
int i=p;
while(i!=-1){
g<<a[i]<<' ';
i=poz[i];
}
}
int main(){
f>>n; for(int i=1;i<=n;i++) f>>a[i];
PD (); g<<mx_element<<'\n';
PRINT_DATA ();
g.close(); return 0;
}