解题思路:有树的地方都设为1,没树设为0
注意事项:
参考代码:
package cWeb.buleCup; import java.util.Scanner; /** * 未成功 * @author Geek * @version 1.0 * @date 2018年6月28日 下午10:19:19 * @TextDemo I hava a acDream * @copyright * @remark */ public class C1099 { public static void main(String[] args) { Scanner in = new Scanner(System.in); int L = in.nextInt() + 1; int M = in.nextInt(); int [] trees = new int [L]; for (int i = 0; i < trees.length; i++) { trees[i] = 1;//1表示有树 } for (int i = 0; i < M; i++) { int start = in.nextInt(); int end = in.nextInt(); for (int j = start; j < end+1; j++) { if(trees[j]==1) { trees[j] =0; } } } int sum = 0; for (int i = 0; i < trees.length; i++) { if(trees[i]!=0) { sum++; } } System.out.println(sum); } }
0.0分
0 人评分