@[ThisIsSirius_859](/user/1029903)
从0开始
by xuzihao123 @ 2023-07-11 11:07:39
@[xuzihao123](/user/946929)
```cpp
#include<iostream>
using namespace std;
int tree[11451],l,m,u[11451],v[11451],remain=0;
int main()
{
cin >> l >> m;
l++;
for(int i=0;i<m;i++){
cin >> u[i] >> v[i];
}
for(int i=0;i<=l;i++){
tree[i]=1;
}
for(int i=0;i<=m;i++){
for(int s=u[i];s<=v[i];s++){
if(tree[s])tree[s]=0;
}
}
for(int i=0;i<=l;i++){
if(tree[i])remain++;
}
cout << remain;
}
```
跪谢大佬！！！但交完还是WA#1...
by ThisIsSirius_859 @ 2023-07-11 11:17:24
@[ThisIsSirius_859](/user/1029903)
这种思路我不太会，我私信给你将一下我的思路吧
by xuzihao123 @ 2023-07-11 11:20:25