思路:建立一个数组,只要这里种了树就赋值为1,然后建地铁的话,就将这段值修改为0,最后统计剩下的1的数量即为剩余树木的数量
#include<iostream>
using namespace std;
int main() {
int l, m;
cin >> l;
int len[10001];
for (int i = 0; i <= l; i++) {
len[i] = 1;
}
cin >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
for (int j = u; j <= v; j++) {
len[j] = 0;
}
}
int count = 0;
for (int i = 0; i <= l; i++) {
if (len[i] == 1) {
count++;
}
}
cout << count;
}