poj1692 Crossed Matchings(dp,最长公共子序列变形,好题)

最新推荐文章于 2020-12-09 08:50:01 发布

___fouzhe

最新推荐文章于 2020-12-09 08:50:01 发布

阅读量558

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/fouzhe/article/details/54849428

版权

动态规划专栏收录该内容

78 篇文章 1 订阅

订阅专栏

博客探讨了poj1692问题，这是一个涉及动态规划和最长公共子序列变形的算法题。文章介绍了匹配规则，解释了如何通过动态规划方法解决这个问题，指出在考虑匹配时需要满足特定条件，如数字相同且匹配对不能交叉。题解部分详细阐述了状态转移方程和不同情况下的处理策略。

摘要由CSDN通过智能技术生成

Crossed Matchings

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2838		Accepted: 1840

Description

There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one is located in the second row. We call this line segment an r-matching segment. The following figure shows a 3-matching and a 2-matching segment.

We want to find the maximum number of matching segments possible to draw for the given input, such that:
1. Each a-matching segment should cross exactly one b-matching segment, where a != b .
2. No two matching segments can be drawn from a number. For example, the following matchings are not allowed.

Write a program to compute the maximum number of matching segments for the input data. Note that this number is always even.

Input

The first line of the input is the number M, which is the number of test cases (1 <= M <= 10). Each test case has three lines. The first line contains N1 and N2, the number of integers on the first and the second row respectively. The next line contains N1 integers which are the numbers on the first row. The third line contains N2 integers which are the numbers on the second row. All numbers are positive integers less than 100.

Output

Output should have one separate line for each test case. The maximum number of matching segments for each test case should be written in one separate line.

Sample Input

3
6 6
1 3 1 3 1 3
3 1 3 1 3 1
4 4
1 1 3 3 
1 1 3 3 
12 11
1 2 3 3 2 4 1 5 1 3 5 10
3 1 2 3 2 4 12 1 5 5 3

Sample Output

6
0
8

Source

Tehran 1999

参考博客链接

题意：

给出两行数，求上下匹配的最多组数是多少。
匹配规则
1.匹配对的数字必须相同
2.每个匹配必须有且只能有一个匹配与之相交叉，且相交叉的两组匹配数字必须不同
3.一个数最多只能匹配一次

题解：

一开始我以为是个二分匹配的题目，后来想了好久不知道怎么处理第二个条件。

这题其实是动态规划题。
分析：用dp[i][j]表示第一行取i个数，第二行取j个数字的最多匹配项
对于某个dp[i][j]:
1.不匹配第一行i个，或不匹配第二行第j个：dp[i][j]=Max(dp[i-1][j],dp[i][j-1])
2.如果a[i]==b[j],不产生新匹配，匹配结果为1的值
3.若a[i]!=b[j]:
a.则第一行从i往前扫，直到扫到第一个a[k1]==b[j](k1 b.同理，第二行从j往前扫，直到扫到第一个b[k2]==a[i](k2 若找不到这样的k1,k2则不能才产生新匹配，跳过
若存在这样的k1,k2,此时匹配（a[i],b[k2]）、(a[k1],b[j])匹配，
才生新的匹配情形,匹配数量为：dp[k1-1][k2-1]+2。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define fi first
#define se second
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const int inf=0x3fffffff;
const ll mod=1000000007;
const int maxn=100+10;
int n,m;
int a[maxn],b[maxn];
int d[maxn][maxn];

int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d",&n,&m);
        rep(i,1,n+1) scanf("%d",&a[i]);
        rep(i,1,m+1) scanf("%d",&b[i]);
        memset(d,0,sizeof(d));
        rep(i,2,n+1) rep(j,2,m+1)
        {
            d[i][j]=max(d[i][j-1],d[i-1][j]);
            if(a[i]==b[j]) continue;
            else
            {
                int p1=0,p2=0;
                for(int k=i-1;k>0;k--)
                {
                    if(a[k]==b[j])
                    {
                        p1=k;
                        break;
                    }
                }
                for(int l=j-1;l>0;l--)
                {
                    if(b[l]==a[i])
                    {
                        p2=l;
                        break;
                    }
                }
                if(p1&&p2) d[i][j]=max(d[i][j],d[p1-1][p2-1]+2);
            }
        }
        printf("%d\n",d[n][m]);
    }    
    return 0;
}