求助
  • 板块AT_dp_a Frog 1
  • 楼主WRuperD
  • 当前回复1
  • 已保存回复1
  • 发布时间2021/5/13 23:04
  • 上次更新2023/11/4 23:18:17
查看原帖
求助
247388
WRuperD楼主2021/5/13 23:04
#include<iostream>
#include<cmath>
using namespace std;
int a[100000+5];
int dp[100000+5];
int main()
{
	int n;
	cin>>n;
	for(int i = 1; i <= n; i++){
		cin>>a[i];
//		cout<<a[i];
	} 
	for(int i = 2; i <= n; i++){
		if(i == 2)	dp[i] = abs(a[i] - a[i-1]); 
		else	dp[i] = min(dp[i-1] + abs(a[i] - a[i-1]), dp[i-2] + abs(a[i] - a[i-2]));
	}
	if(dp[n] != 0)	cout<<dp[n]<<endl;
	return 0;
 } 
2021/5/13 23:04
加载中...