题目链接
思路:
不难想到状态可以定义为:
f
[
i
]
[
j
]
f[i][j]
f[i][j]表示到达坐标
(
i
,
j
)
(i,j)
(i,j)所需要的最小点击数
我们考虑坐标
(
i
,
j
)
(i,j)
(i,j)可以由哪些坐标
(
i
−
1
,
k
)
(i-1,k)
(i−1,k)抵达。
我们先考虑上升操作,由于上升操作可以点击无限次,那么可以套用完全背包的转移方式。
对于下降操作,只有一次或零次,那么可以套用01背包的转移方式。
用
y
[
i
]
y[i]
y[i]表示每次下降操作下降的高度,
x
[
i
]
x[i]
x[i]表示每次上升操作上升的高度。
那么对于上升操作,转移为:
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
−
1
]
[
j
−
x
[
i
]
]
+
1
,
f
[
i
]
[
j
−
x
[
i
]
]
+
1
)
f[i][j] = min(f[i - 1][j - x[i]] + 1, f[i][j - x[i]] + 1)
f[i][j]=min(f[i−1][j−x[i]]+1,f[i][j−x[i]]+1)
其中
f
[
i
]
[
j
−
x
[
i
]
]
+
1
=
m
i
n
(
f
[
i
−
1
]
[
j
−
2
∗
x
[
i
]
]
+
2
,
f
[
i
−
1
]
[
j
−
3
∗
x
[
i
]
]
+
3
,
.
.
.
.
)
f[i][j - x[i]] + 1 = min(f[i - 1][j - 2 * x[i]] + 2, f[i - 1][j - 3 * x[i]] + 3, ....)
f[i][j−x[i]]+1=min(f[i−1][j−2∗x[i]]+2,f[i−1][j−3∗x[i]]+3,....)
对于下降操作,转移为:
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
]
[
j
]
,
f
[
i
−
1
]
[
j
+
y
[
i
]
]
)
f[i][j] = min(f[i][j], f[i - 1][j + y[i]])
f[i][j]=min(f[i][j],f[i−1][j+y[i]])
高度遍历采用正序遍历(想一想为什么)
还有一个细节就是,高度是允许超过
m
m
m的,最高是
m
+
m
a
x
(
x
[
i
]
)
m + max(x[i])
m+max(x[i]),所以数组要开大一点。
AC代码:
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 10005, M = 2005, INF = 0x3f3f3f3f;
int n, m, k;
int f[N][M];
int x[N], y[N];
int l[N], h[N];
bool flag[N];
int main()
{
memset(flag, false, sizeof flag);
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i ++ )
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= n; i ++ )
h[i] = m + 1, l[i] = 0;
for (int i = 1; i <= k; i ++ )
{
int p, hh, ll;
scanf("%d%d%d", &p, &ll, &hh);
h[p] = hh, l[p] = ll;
flag[p] = true;
}
memset(f, 0x3f, sizeof f);
for (int i = 1; i <= m; i ++ )
f[0][i] = 0;
for (int i = 1; i <= n; i ++ )
{
for (int j = x[i] + 1; j <= x[i] + m; j ++ )
f[i][j] = min(f[i - 1][j - x[i]] + 1, f[i][j - x[i]] + 1);
for (int j = m + 1; j <= x[i] + m; j ++ )
f[i][m] = min(f[i][m], f[i][j]);
for (int j = 1; j <= m - y[i]; j ++ )
f[i][j] = min(f[i][j], f[i - 1][j + y[i]]);
for (int j = 1; j <= l[i]; j ++ )
f[i][j] = INF;
for (int j = h[i]; j <= m; j ++ )
f[i][j] = INF;
}
int ans = INF;
for (int i = 1; i <= m; i ++ )
ans = min(ans, f[n][i]);
if (ans != INF)
{
cout << 1 << endl << ans << endl;
return 0;
}
int i, j;
for (i = n; i; i -- )
{
for (j = 1; j <= m; j ++ )
if (f[i][j] < INF) break;
if (j <= m) break;
}
ans = 0;
for (j = 1; j <= i; j ++ )
if (flag[j]) ans ++;
cout << 0 << endl << ans << endl;
return 0;
}