E . Takahashi and Animals（dp）

link

我们的初始状态有两种状态 跑两轮dp即可

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define INF 0x3f3f3f3f3f
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
const int maxn=1e5+10;
const int mod=1e9+7;
/*ll qsm(int a,int b)
{ll res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
*/
const int N=3e5+10;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int dp[N][2];
int a[N];
void solve()
{	cin>>n;
	fer(i,1,n)cin>>a[i];
	if(n==2){
		cout<<min(a[1],a[2])<<endl;
		return ;
	}
	int ans=inf;
	memset(dp,0x3f3f,sizeof(dp));
	dp[1][1]=a[1];
	fer(i,1,n)
	{
		dp[i+1][0]=min(dp[i+1][0],dp[i][1]);
		dp[i+1][1]=min(dp[i+1][1],min(dp[i][0],dp[i][1])+a[i+1]);
	}          
	ans=min(dp[n-1][1],dp[n][1]);
    memset(dp,0x3f3f,sizeof(dp));
	dp[1][0]=a[n];
	fer(i,1,n-1)
	{
		dp[i+1][0]=min(dp[i+1][0],dp[i][1]);
		dp[i+1][1]=min(dp[i+1][1],min(dp[i][0],dp[i][1])+a[i+1]);
	}
	ans=min(ans,min(dp[n-1][1],dp[n-2][1]));cout<<ans<<endl;	 
}

signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}