BZOJ 1664 [Usaco2006 Open] County Fair Events 参加节日庆祝

Description

Farmer John has returned to the County Fair so he can attend the special events (concerts, rodeos, cooking shows, etc.). He wants to attend as many of the N (1 <= N <= 10,000) special events as he possibly can. He's rented a bicycle so he can speed from one event to the next in absolutely no time at all (0 time units to go from one event to the next!). Given a list of the events that FJ might wish to attend, with their start times (1 <= T <= 100,000) and their durations (1 <= L <= 100,000), determine the maximum number of events that FJ can attend. FJ never leaves an event early.

 

有N个节日每个节日有个开始时间,及持续时间. 牛想尽可能多的参加节日,问最多可以参加多少. 注意牛的转移速度是极快的,不花时间.

Input

* Line 1: A single integer, N.

* Lines 2..N+1: Each line contains two space-separated integers, T and L, that describe an event that FJ might attend.

Output

* Line 1: A single integer that is the maximum number of events FJ can attend.

Sample Input

7
1 6
8 6
14 5
19 2
1 8
18 3
10 6

INPUT DETAILS:

Graphic picture of the schedule:
11111111112
12345678901234567890---------这个是时间轴.
--------------------
111111 2222223333344
55555555 777777 666

这个图中1代表第一个节日从1开始,持续6个时间,直到6.

Sample Output

4

OUTPUT DETAILS:

FJ can do no better than to attend events 1, 2, 3, and 4.

HINT

Source

Silver

~~~~~~~~~~~~~~~~~~~~~~~~~~~~

DP+贪心~

奇奇怪怪的n^2算法居然能过10000……

先把所有事情都记录成l和r，然后按照先l后r的顺序排序，我们用f[i]表示事件i（计算在内）发生时间之前（包含事件i）的最多发生的事数，那么直接DP即可~

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int n,f[10001];

struct node{
	int l,r;
}a[10001];

int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=-1;ch=getchar();}
	while(ch>='0' && ch<='9') {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f; 
}

bool operator < (node u,node v)
{
	return u.l==v.l ? u.r<v.r:u.l<v.l;
}

int main()
{
	n=read();
	for(int i=1;i<=n;i++)
	{
		a[i].l=read();a[i].r=read()+a[i].l-1;
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)
	{
		f[i]=1;
		for(int j=1;j<i;j++) if(a[j].r<a[i].l) f[i]=max(f[i],f[j]+1);
	}
	printf("%d\n",f[n]);;
	return 0;
}