KY25 剩下的树

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int main(){
    int n,m,left,right;
    while(scanf("%d %d",&n,&m)!=EOF){
        int a[10005]={0};
        for(int i=0;i<m;i++){
            cin>>left>>right;
            a[left]=-1;
            a[right]=1;
            if(left==right)
                a[left]=2;
        }
        int begin,k=0,del=0;
        for(int i=0;i<=n;i++){
            if(a[i]==2){
                del+=1;
                continue;
            }

            if(a[i]==-1){
                if(k==0){
                    begin=i;
                }
                k++;
            }
            else if(a[i]==1){
                k--;
                if(k==0){
                    del+=(i-begin)+1;
                }
            }
        }
        cout<<n+1-del<<endl;
    }
    return 0;
}