九度题目1088：剩下的树 2011年清华大学计算机研究生机试真题

 
#include<iostream>
#include<cstdio>
using namespace std;
int scoreNumber[10001];
int main()
{
    int i = 0, j =0;
    for (i = 0; i < 10001; i++)
    {
        scoreNumber[i] = 1;
    }
    int N, M, temp1, temp2,Number=0;
    while (cin >> N >> M)
    {
        for (i = 0; i < M; i++)
        {
            cin >> temp1 >> temp2;
            for (j = temp1; j <= temp2; j++)
            {
                scoreNumber[j] = 0;
            }
        }
        for (i = 0; i <= N; i++)
        {
            if (scoreNumber[i]==1)
            {
                Number++;
            }
        }
        cout << Number << endl;
        Number = 0;
        for (i = 0; i < 10001; i++)
        {
            scoreNumber[i] = 1;
        }
    }
    return 0;
}
 
/**************************************************************
    Problem: 1088
    User: hrdjmax2
    Language: C++
    Result: Accepted
    Time:50 ms
    Memory:1556 kb
****************************************************************/