#include<stdio.h>
int arr[100001] = {0};
int main() {
int d;
scanf("%d", &d);
int q;
scanf("%d", &q);
int m, n;
for (int i = 0; i < q; ++i) {
scanf("%d %d", &m, &n);
for (int j = m; j <= n; j++) {
if (!arr[j]) {
arr[j] = 1;
}
}
}
int count = 0;
for (int i = 1(0); i <= d; i++) {
if (!arr[i])
count++;
}
printf("%d", count);
}
n^2+n
降低复杂度:
n+n
{
int x, y, l, m, i, ans = 0, flag = 0;
scanf("%d%d",&l,&m);
for(i = 0; i < m; i++){
scanf("%d%d",&x,&y);
a[x]=x;
a[y]=-x;
}
for(i = 0; i <= l; i++){
if(a[i] != 0){
flag += a[i];
continue;//若不结束,右端点可能被计入ans
}
if(!flag)ans++;
}
printf("%d\n",ans);
}