这道“校门外的树”的算法我不是很理解,希望大家帮我解析一下代码,并举个实际数据的例子给我看一下,非常感谢!
#include <cstdio>
#include <cstring>
int main()
{
int m, n, l, k;
int a[10001];
while (scanf("%d%d", &m, &n) != EOF)
{
memset(a, 0, sizeof(a));
while (n--)
{
scanf("%d%d", &l, &k);
for (int i = 1; i <= k; i++)
{
a[i] = 1;
}
}
int count = 0;
for(int j = 0; j <= m, j++)
{
if(a[j] == 0)
count++;
}
printf("%d\n", count);
}
return 0;
}