骨牌问题

#include<fstream>

#include<iostream>

#include<math.h>

#define MAXNUM 6

#define AVG MAXNUM*6

#define INF 99999

using namespace std;

ifstream fin("input.txt");

int up[MAXNUM];

int down[MAXNUM];

int f[MAXNUM][2*AVG];

int main(){

int n,i,j,minv,maxv;

fin >> n;

for(i=1;i<=n;i++){

fin >> up[i] >> down[i];

}

for(i=1;i<=MAXNUM;i++)

for(j=1;j<=2*AVG;j++)

f[i][j] = INF;

for(i=1;i<=2*AVG;i++)

if(i != AVG)

f[0][i] = INF;

else

f[0][i] = 0;

minv = AVG;

maxv = AVG;

for(i=1;i<=n;i++){

minv = minv - (up[i] - down[i]);

maxv = maxv - (down[i] - up[i]);

for(j=minv;j<=maxv;j++){

int t1 = f[i-1][j-(up[i]-down[i])];

int t2 = f[i-1][j-(down[i]-up[i])]+1;

f[i][j] = min(t1,t2);

}

}

for(i=1,minv=INF;i<=2*AVG;i++){

if(f[n][i] != INF && minv>abs(i - AVG)){

minv = abs(i - AVG);

j = i;

}

}

cout<<"min distance : "<<j<<endl;

cout<<"min count : "<<f[n][j]<<endl;

}