Pagini recente » Cod sursa (job #280190) | preONI 2005 runda #1 - solutii | Cod sursa (job #2841880) | Cod sursa (job #720132) | Cod sursa (job #2721091)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, maxim, p;
int v[100005];
int dp[100005];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
dp[n]=1;
for(int i=n-1; i>=1; i--)
{
//dp[i]=1;
for(int j=i+1; j<=n; j++)
{
if(v[j]>v[i] && dp[i] < dp[j]+1)
dp[i] = dp[j]+1;
}
}
for(int i=2; i<=n; i++)
if(dp[i]>maxim)
maxim=dp[i], p=i;
fout<<maxim<<"\n";
fout<<v[p]<<" ";
while(1)
{
bool gasit=0;
for(int i=p+1; i<=n; i++)
{
if(dp[i]==dp[p]-1 && v[p]<v[i])
{
fout<<v[i]<<" ";
p=i;
gasit=1;
break;
}
}
if(!gasit)
break;
}
return 0;
}