public class 小Q爬塔
{
public static void main(String[] args)
{
int[] p = new int[10005];
int[] t = new int[10005];
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 1; i <= n; i ++)
{
int x = sc.nextInt();
p[i] = Math.min(p[i-1],t[i-1]) + x;
if (i == 1)
continue;
t[i] = Math.min(p[i-1],p[i-2]);
}
System.out.println(Math.min(p[n],t[n]));
}
}
小Q爬塔
最新推荐文章于 2020-12-08 01:27:54 发布