P1280 [CHCI 2002 National Competition #2 Juniors] 尼克的任务

点击查看代码

#include<bits/stdc++.h>
using namespace std;

const int N=1e4+10;

vector<int> tasks[N];
int n,k;
int dp[N];

int main()
{
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>n>>k;

    for(int i=0,p,t;i<k;i++){
        cin>>p>>t;
        tasks[p].push_back(t);
    }

    for(int i=n;i>=1;i--){
        if(tasks[i].empty()){
            dp[i]=dp[i+1]+1;
        }else{
            for(auto& t : tasks[i]){
                dp[i]=max(dp[i],dp[i+t]);
            }
        }
    }

    cout<<dp[1]<<"\n";

    return 0;

    

    
}