[ACM_动态规划] ZOJ 1425 Crossed Matchings(交叉最大匹配 动态规划）

0
0
0
1. 云栖社区>
2. 博客>
3. 正文

## [ACM_动态规划] ZOJ 1425 Crossed Matchings(交叉最大匹配 动态规划）

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 file 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 file 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

opt[i][j] = max{ opt[i-1][j], opt[i][j-1], opt[a-1][b-1] + 2}

>_< :上式 a,b　的取值须满足 (1 <= a < i) && (1 <= b < j)　并且存在匹配 (up[a] == down[j]) && (down[b] == up[i]) && (up[a] != up[i])

``` 1 #include<iostream>
2 #include<string.h>
3 using namespace std;
4 int M;
5 int N1,N2;
6 int up[105],down[105];
7 int opt[105][105];
8 int main(){
9     cin>>M;
10     while(M--){
11         cin>>N1>>N2;
12         memset(opt,0,sizeof(opt));
13         for(int i=1;i<=N1;i++)cin>>up[i];
14         for(int j=1;j<=N2;j++)cin>>down[j];
15
16         for(int i=1;i<=N1;i++){
17             for(int j=1;j<=N2;j++){
18                 opt[i][j]= opt[i-1][j]>opt[i][j-1] ? opt[i-1][j]:opt[i][j-1];
19                 if(up[i]!=down[j]){//只有最后2个不一样时才有可能都和前面的有匹配
20                     int t=0;
21                     for(int a=1;a<i;a++){
22                         for(int b=1;b<j;b++){//遍历查找满足条件的t
23                              if(up[a]==down[j] && up[i]==down[b] && t<opt[a-1][b-1]+2)
24                                 t=opt[a-1][b-1]+2;
25                         }
26                     }
27                     opt[i][j]=opt[i][j]>t ? opt[i][j]:t;
28                 }
29             }
30         }
31
32         cout<<opt[N1][N2]<<'\n';
33     }return 0;
34 }```

+ 关注