package A类有价值的回顾的;
import java.util.Scanner;
//对于这道题,你得到的经验就是说,对于格子的选择与谁有关,这就是在递归中需要传递的
//最重要的是,不知道出什么样的题目,将会丢失目标
public class 剪格子 {
public static int[][] a = new int[11][11];//输入的数
public static int m ,n,k=1,num = 0;
public static int sum = 0,sum2 = 0;
public static int[] kk = new int[11*11];
public static boolean[][] b = new boolean[11][11];
public static void f(int i,int j){
if(sum == sum2-sum){
kk[num] = k;
num ++;
return;
}
if(sum > sum2-sum)
return;
if(i<n&&b[i+1][j] == false){
sum = sum + a[i+1][j];
k++;
b[i+1][j] = true;
f(i+1,j);
b[i+1][j] = false;
k--;
sum = sum - a[i+1][j];
}
if(i>1&&b[i-1][j] == false){
sum = sum + a[i-1][j];
k++;
b[i-1][j] = true;
f(i-1,j);
b[i-1][j] = false;
k--;
sum = sum - a[i-1][j];
}
if(j<m&&b[i][j+1] == false){
sum = sum + a[i][j+1];
k++;
b[i][j+1] = true;
f(i,j+1);
b[i][j+1] = false;
k--;
sum = sum - a[i][j+1];
}
if(j>1&&b[i][j-1] == false){
sum = sum + a[i][j-1];
b[i][j-1] = true;
k++;
f(i,j-1);
b[i][j-1] = false;
k--;
sum = sum - a[i][j-1];//这些小错误,写的时候就给他避免的效率比去找的效率高很多
}
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
m = sc.nextInt();//看清题目要求
n = sc.nextInt();
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
a[i][j] = sc.nextInt();
sum2 = sum2 + a[i][j];
}
}
sum = a[1][1];//要判断好第一次,是否需要作出改变
f(1,1);
int min=1000000;//求最小值的时的初值必须无限的大
for(int i=0;i<num;i++){
min = Math.min(min, kk[i]);
}
System.out.println(min);
}
}
剪格子.java
最新推荐文章于 2023-01-06 12:53:09 发布