贪心练习题： ZOJ 2510(没做)、HDU1009(背包 贪心)、POJ Bookshelf、zoj 1543 Stripies、poj 1328 Radar Installation、
[cpp]
#include
#include
using namespace std;
struct program {
int start;
int end;
/*
bool operator <(const program t) const{
if(this->start !=t.start)
return this->start < t.start;
else
return this->end < t.end;
}
*/
};
/*
bool operator <(const program &a, const program &b)
{
if(a.start !=b.start)
return a.start
return a.end
*/
int cmp(const program &a, const program &b)
{
if(a.start !=b.start)
return a.start
const int N = 101;
program list[N];
int main()
{
int n, i, total, mark;
//freopen("in.txt","r",stdin);
while(scanf("%d",&n),n)
{
for(i=0;i
sort(list,list+n,cmp);
//for(i=0;i
for(i=1;i
{
mark = list[i].end;
total++;
}else
{
if(mark >list[i].end)
mark = list[i].end;
}
printf("%d\n",total);
}
return 0;
}