Pagini recente » Cod sursa (job #2255364) | Cod sursa (job #82056) | Cod sursa (job #1118064) | Cod sursa (job #2389589) | Cod sursa (job #1762597)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f1("scmax.in");
ofstream f2("smax.out");
int i,j,n,x[100005],DP[100005],sol,k,l,maxx;
void cit(){
f1>>n;
for(i=1;i<=n;i++){
f1>>x[i];
}
}
void rez(){
for (i=n;i>=1;i--){
for(j=i+1;j<=n;j++){
if(x[i]<x[j]&&DP[j]>DP[i]){
DP[i]=DP[j];
}
}
DP[i]++;
}
sol=1;
for(i=1;i<=n;i++){ if (DP[i]>sol){l=i;};sol=max(sol,DP[i]); }
f2<<sol<<'\n'; k=1; maxx=x[l]; f2<<x[l]<<' ';
while(k<sol){l++; if(x[l]>maxx){f2<<x[l]<<' '; k++; maxx=x[l];}}
}
int main()
{
cit();
rez();
return 0;
}