動態規劃之直線k覆蓋問題

import java.util.Scanner; public class ZhiXianKFuGai {     private static int n,m,r;     private static int[] x,w,c;     private static int[][] opt1,opt2;     private static int MAX = 1000000;     pub

>>阅读原文<<