| 问题描述:
活动安排问题,尽可能多安排活动
| 问题分析:
按活动结束时间降序排列,然后每次贪心选择结束时间最早的活动;
代码本身不难,但是要想清楚贪心策略的原理;
| 贪心证明:
参考博客
AC C++代码:
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#define maxSize 1000
using namespace std;
struct activity {
int start, end;
bool re;
bool operator < (const activity & A) const {
return end < A.end; //重载操作符
}
}act[maxSize];
bool cmp(activity a, activity b) {//sort三参数时用
return a.end < b.end;
}
int beGreedy(int n) {
act[0].re = true;
int count = 1, pre = 0;
for (int i = 1; i < n; i++) {
if (act[i].start >= act[pre].end) { //入选
act[i].re = true;
pre = i;
count++; //活动数
}
else
act[i].re = false; //落选
}
return count;
}
int main() {
int n,temp;
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i++) {
cin >> act[i].start >> act[i].end;
}
sort(act, act + n);
int count = beGreedy(n);//贪心选择
cout << count << endl;
cin >> n;
}
return 0;
}