题解 | #剩下的树#
剩下的树
https://www.nowcoder.com/practice/f5787c69f5cf41499ba4706bc93700a2
#include<bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
vector<int> v(m + 1, 0);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
for (int j = x; j <= y; j++) {
v[j] = 1;
}
}
cout << count(v.begin(), v.end(), 0);
return 0;
}
投递华为等公司10个岗位 >