蓝桥杯算法提高-秘密行动( C语言)

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int jump[10005];

int climb[10005];

int m_min(int x,int y)

{

    return x<y?x:y;

}

int  main()

{

    int n,i;

  scanf("%d",&n);

    for(i=1;i<=n;i++)

    {

  scanf("%d",&climb[i]);

        if(i>1)jump[i]=m_min(climb[i-1],climb[i-2]);

        climb[i]=m_min(climb[i-1],jump[i-1])+climb[i];

    }

    int ans=m_min(jump[n],climb[n]);

printf("%d",ans);

    return 0;

}