ADV-165超级玛丽

PS:

1.定义跳法数组、陷阱数组

2.将陷阱位置写入数组，做好标记，下一个跳法时恢复:r[1]=1

3.回溯法构建跳法数组

4.输出，并return 0

#includeint main(void){int n,m;int r[105]={0};int can[105]={0};int i,j;scanf("%d%d",&n,&m);for(i=0;i<=m;++i){scanf("%d",&j);can[j]=1;}r[1]=1;for(i=2;i<=n;++i){if(can[i]==0)r[i]=r[i-1]+r[i-2];}printf("%d",r[n]);return 0;}