设
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j] 表示前
i
i
i 个骨牌第一行和为
j
j
j 时旋转最少次数。
d
p
[
i
]
[
j
]
=
min
1
≤
i
≤
n
,
0
≤
j
≤
6000
{
d
p
[
i
−
1
]
[
j
−
a
[
i
]
]
,
d
p
[
i
−
1
]
[
j
−
b
[
i
]
]
+
1
}
dp[i][j]=\min\limits_{1\leq i\leq n,0\leq j\leq6000}\{dp[i-1][j-a[i]],dp[i-1][j-b[i]]+1\}
dp[i][j]=1≤i≤n,0≤j≤6000min{dp[i−1][j−a[i]],dp[i−1][j−b[i]]+1}
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=1e3+10,M=6e3;
int n,dp[N][M+10],a[N],b[N],sum;
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i],&b[i]),sum+=a[i]+b[i];
memset(dp,0x3f,sizeof(dp));
dp[0][0]=dp[1][a[1]]=0;dp[1][b[1]]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=M;j++)
{
if(j>=a[i])dp[i][j]=min(dp[i][j],dp[i-1][j-a[i]]);
if(j>=b[i])dp[i][j]=min(dp[i][j],dp[i-1][j-b[i]]+1);
}
int minn=0x3f3f3f3f,ans=0x3f3f3f3f;
for(int j=0;j<=M;j++)
if(abs(sum-j-j)<minn)minn=abs(sum-j-j),ans=dp[n][j];
else if(abs(sum-j-j)==minn)ans=min(ans,dp[n][j]);
printf("%d\n",ans);
}
总结
最开始状态定义不对,本来想定义前i个位置翻转j次的和,但是发现不好转移且没啥卵用。状态的定义是很关键的,定义对了才能转移求解。