题解 | #剩下的树#
剩下的树
https://www.nowcoder.com/practice/f5787c69f5cf41499ba4706bc93700a2
#include <iostream> using namespace std; const int maxn = 10001; bool isMove[maxn]; int main(){ int L,m,count; cin >> L >> m; while(m --){ int l,r; cin >> l >> r; for(int i = l;i <= r;i ++){ isMove[i] = true; } } for(int i = 0;i <= L;i ++){ if(!isMove[i])count ++; } cout << count << endl; return 0; }