题目:http://60.191.162.158:8080/JudgeOnline/showproblem?problem_id=1230
代码:
#include<stdio.h>
int f[10001]={0},task[10001][3]={0},time[10001][3]={0};
int main()
{
int n,k,i,j,p;
scanf("%d%d",&n,&k);
p=0;
for(i=1;i<=k;i++){
scanf("%d %d",&task[i][1],&task[i][2]);
time[task[i][1]][0]=1;
if(task[i][1]==p)time[task[i][1]][2]=i;
else {
time[p][2]=i-1;
time[task[i][1]][1]=i;
p=task[i][1];
}
}
time[task[k][1]][2]=k;
f[n+1]=0;
for(i=n;i>=1;i--){
if(time[i][0]==1){
f[i]=f[i+task[time[i][1]][2]];
for(j=time[i][1];j<=time[i][2];j++){
if(f[i+task[j][2]]>f[i])f[i]=f[i+task[j][2]];
}
}
else f[i]=f[i+1]+1;
}
printf("%d",f[1]);
return 0;
}
一定要是倒序的么,还有,状态要怎么判断