P1280 尼克的任务

//#define local
#include<cstdio>
#include<iostream>
#include<cmath>
#include<vector>
#define MAXN 10005
using namespace std;
typedef long long ll; 
int n,k;
vector<int>t[MAXN];
int f[MAXN]={0};
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
scanf("%d%d",&n,&k);
for(int i=0;i<k;++i){
	int a,b;
	scanf("%d%d",&a,&b);
	t[a].push_back(b);
}
for(int i=n;i>=1;--i){
	if(!t[i].size())
	f[i]=f[i+1]+1;
	else{
		for(int j=0;j<t[i].size();++j){
			int time=t[i][j];
			f[i]=max(f[i],f[i+time]);
		}
	} 
}

cout<<f[1];
return 0;
}