Pagini recente » Cod sursa (job #2670267) | Cod sursa (job #2248234) | Cod sursa (job #2248989) | Cod sursa (job #2420000) | Cod sursa (job #2161727)
#include <fstream>
using namespace std;
ifstream input("scmax.in");
ofstream print("scmax.out");
int V[1002],dp[1002];
bool B[1002];
int n,i,j;
int main(){
input>>n;
for(i=1;i<=n;i++)input>>V[i];
for(i=1;i<=n;i++)dp[i]=1;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
if(V[i]>V[j]&&dp[i]<dp[j]+1){
dp[i]=dp[j]+1;
if(B[i]==false)
B[i]=true;}
int maxim=0;
for(i=1;i<=n;i++)
if(maxim<dp[i])maxim=dp[i];
int x=maxim;
for(i=1;i<=n;i++)if(B[i]==true)print<<V[i]<<" ";
return 0;
}