【动态规划】多米诺骨

 

#include <bits/stdc++.h>
using namespace std;
const int m=6000;
int f[1010][m*2+2],n,a[2000],b[2000],k;
int main() {
    memset(f, 0x3f, sizeof(f));
    scanf("%d", &n);
    f[0][m] = 0;
    for (int i = 1; i <= n; i++) {
        scanf("%d%d", &a[i], &b[i]);
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m * 2; j++) {
            f[i][j] = min(f[i - 1][j - a[i] + b[i]], f[i - 1][j + a[i] - b[i]] + 1);
        }
    }
    k = 0;
    if (f[n][m + k] == f[0][1] && f[n][m - k] == f[0][1]) {
        k++;
    }
    printf("%d\n", min(f[n][m + k], f[n][m - k]));
}