(10D)codeforce

题意：LCIS裸题，只不过要求输出路径。。

#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LL __int64
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0xfffffff
#define pi 2*acos(0.0)
#define mod 10007

using namespace std;

int a[1009];
int b[1009];
int dp[1009];
int num[1009];
int pre[509][509];


void LCS(int n, int m)
{
    int ans = 0;
    int x,y;
    memset(dp, 0, sizeof(dp));
    for(int i = 1; i <= n; i++)
    {
        int last = 0;
        int tmp = 0; // 存 i 确定, 且 a[i] > b[j] 时最大的 dp[j]
        for(int j = 1; j <= m; j++)
        {
            if(a[i] > b[j] && dp[j] > tmp)
            {
                tmp = dp[j];
                last = j;
            }
            else if(a[i] == b[j])
            {
                dp[j] = tmp+1;
                pre[i][j] = last;
            }
            if(dp[j]>ans)
            {
                ans = dp[j];
                x = i;
                y = j;
            }
        }
    }
    //cout<<x<<" "<<y<<endl;
    printf("%d\n",ans);
    int ss = ans;
    for(int i = ans;i>=1;i--)
    {
        num[i] = b[y];
        y = pre[x--][y];
        while(a[x]!=b[y])
        {
            x--;
        }
    }
    for(int i = 1;i<=ans;i++)
    {
        if(i!=1)
        {
            printf(" ");
        }
        printf("%d",num[i]);
    }
    printf("\n");
}
int main()
{
    int n,m;
    while(~scanf("%d",&n))
    {
        for(int i = 1; i<=n; i++)
        {
            scanf("%d",&a[i]);
        }
        scanf("%d",&m);
        for(int i = 1; i<=m; i++)
        {
            scanf("%d",&b[i]);
        }
        memset(pre,-1,sizeof(pre));
        LCS(n,m);
    }
    return 0;
}