#include <iostream> |
using namespace std; |
int a[10001]={0}; |
int main() |
{ |
int L, M; |
cin >> L >> M; |
for ( int i = 0; i < M; i++) |
{ int m, n; |
cin >> m >> n; |
if (m > n) |
{ int temp=m; |
m=n; |
n=temp; |
} |
for ( int j = m; j <= n; j++) |
a[j]=1; //打表标记移除树 |
} |
int count=0; |
for ( int k = 0; k <= L; k++) |
if (a[k]==1) |
count++; //总共移除树 |
cout << L+1-count << endl; //总共有L+1棵树 |
return 0; |
} |
高级设计师
by: 小蜜锋 发表于:2014-05-27 20:10:12 顶(0) | 踩(1) 回复
原题是怎样的?
回复评论