AC代碼：

#include <iostream> #include <cstdio> #include <algorithm> #define Max 105 using namespace std;struct TimeList {int start;int end; }timelist[Max]; bool compare(TimeList a, TimeList b) {if(a.end == b.end)return a.start < b.start;elsereturn a.end < b.end; }int main(void) {freopen("in.txt","r",stdin);int N;while(scanf("%d",&N) && N) //輸入N {for(int i = 1; i <= N; i++) //輸入時(shí)間表 scanf("%d%d",&timelist[i].start,&timelist[i].end);sort(timelist + 1, timelist + 1 + N, compare);int count = 1, sign = 1, start = timelist[1].start, end = timelist[1].end;for(int i = 2; i <= N; i++){if(timelist[i].start >= end){sign++;start = timelist[i].start;end = timelist[i].end;}}printf("%d\n",sign);}fclose(stdin);system("pause");return 0; }

?

轉(zhuǎn)載于:https://www.cnblogs.com/phaLQ/p/9880883.html

總結(jié)

以上是生活随笔為你收集整理的HDOJ 2037:今年暑假不AC_大二写的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。