游戏过关

最新推荐文章于 2024-05-07 18:00:58 发布

EmslieWu

最新推荐文章于 2024-05-07 18:00:58 发布

阅读量226

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/emslie/article/details/54584734

版权

算法专栏收录该内容

35 篇文章 0 订阅

订阅专栏

package work;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class GuoGuan {
static int N;
static int min_cost;
static int[] dataA;
static int[] dataM;

public static void main(String args[]) throws FileNotFoundException {
  /* Scanner sc=new Scanner(System.in); */
  Scanner sc = new Scanner(new File("src/guoguan.txt"));
  int T = sc.nextInt();
  for (int t = 0; t < T; t++) {
   N = sc.nextInt();
   min_cost = 0;
   dataA = new int[N];
   dataM = new int[N];
   for (int j = 0; j < N; j++) {
    dataA[j] = sc.nextInt();
    dataM[j] = sc.nextInt();
    min_cost += dataM[j];
   }
   fun(0, 0, 0, 0, 0);
   System.out.println("#" + (t + 1) + " " + min_cost);
  }

}

private static void fun(int step, int money, int s1, int s2, int s3) {
  // TODO Auto-generated method stub
  if (step == N) {
   if (money < min_cost)
    min_cost = money;
    return;
  }
  if (money >= min_cost) {
   return;
  }
  // 买关过关
  fun(step + 1, money + dataM[step], s1, s2, s3);
  // 买兵过关
  fun(step + 1, money + dataM[step] * 2, s1, s2, s3+dataA[step]);
  // 战斗过关
  if (s1 + s2 + s3 >= dataA[step]) {
   if (s1 >= dataA[step]) {
    s1 = s2;
    s2 = s3;
   } else {
    if (s1 + s2 > dataA[step]) {
     s1 = s1 + s2 - dataA[step];
     s2 = s3;
    } else {

     s2 = s1 + s2 + s3 - dataA[step];
     s1 = 0;
    }
   }
   fun(step + 1, money, s1, s2, 0);
  }

}

/*
* private static void fnc1() { // TODO Auto-generated method stub int
* cost=0,armsnum=0; int time[]=new int[3];
*
* for(int i=0;i<N;i++){ if(data[i]==1){ cost=cost+datam[i];
* if(cost<min_cost){break;} } if(data[i]==2){ cost=cost+2*datam[i];
* armsnum=armsnum+datap[i]; time[i]=3; if(cost<min_cost){break;} }
* if(data[i]==3){ if(armsnum<datap[i]){break;}
*
* } } }
*/

}

、、input

5
7
10 100
70 5
80 15
20 60
50 90
30 80
10 10
9
600 800
300 400
300 400
1000 400
300 600
100 300
600 300
600 500
1000 300
11
1000 10
700 900
400 500
300 10
900 900
300 10
50 900
50 900
700 900
500 900
50 10
20
896 546
543 216
454 310
408 367
40 602
252 582
954 627
850 234
763 479
232 278
301 538
528 508
936 154
629 443
758 336
432 700
882 256
278 738
517 882
317 136
20
410 610
831 909
675 629
421 774
386 869
544 219
492 414
996 557
499 482
231 285
804 978
304 881
489 911
75 315
927 648
252 914
330 396
937 133
495 882
813 717