题目描述
现在有个圆,圆上有些弦,现在要求所有弦都不相交并且删掉的弦最少
样例输入
5
91 31
1 45
27 5
11 65
43 72
样例输出
3
思路
破环为链,即把环拆成线然后翻倍,那么区间dp
设
f
i
,
j
f_{i,j}
fi,j为i到j的弧上的最大连弦数
那么
f
i
,
j
=
m
a
x
(
f
i
,
j
,
f
i
,
k
+
f
k
,
j
)
f_{i,j} = max(f_{i,j}, f_{i,k} + f_{k,j})
fi,j=max(fi,j,fi,k+fk,j)
还要再加个
a
i
,
j
a_{i,j}
ai,j,即i,j之间有无弦
代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n, a, b, ans;
int f[205][205], w[205][205];
int main()
{
freopen("line.in", "r", stdin);
freopen("line.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%d%d", &a, &b);
if(a > b) swap(a, b);
w[a][b] = 1;
w[a + 100][b + 100] = 1;
}
for(int dis = 1; dis <= 100; ++dis)
for(int i = 1; i + dis - 1 <= 200; ++i)
{
int j = i + dis - 1;
for(int k = i; k <= j; ++k)
f[i][j] = max(f[i][k] + f[k][j], f[i][j]);
f[i][j] += w[i][j];
}
for(int i = 1; i <= 100; ++i)
ans = max(ans, f[i][i + 100 - 1]);
printf("%d", ans);
return 0;
}