题解 | #剩下的树#
剩下的树
https://www.nowcoder.com/practice/f5787c69f5cf41499ba4706bc93700a2
#include <iostream>
#include <cstdio>
int main() {
int tree[10001]; //1表示活着,0表示死了
int L,M; //种L棵树, M组数据
scanf("%d%d", &L, &M);
//种L + 1棵树
for(int i = 0; i <= L; i++){
tree[i] = 1;
}
for(int index = 0; index < M; index++){
int left, right;
scanf("%d%d", &left, &right);
for(int i = left; i <= right; i++){
tree[i] = 0;
}
}
int count = 0;
for(int i = 0; i <= L; i++){
if(1 == tree[i]){
count++;
}
}
printf("%d", count);
}
查看20道真题和解析

