51nod 2487 小b和环

题目链接：

https://www.51nod.com/Challenge/Problem.html#!#problemId=2487

公式推一下，233 

分为两个dp一个是选a[1]不选a[n]和a[2];

另外一个是不选a[1],

注意特判n == 1的情况

代码如下

#include <bits/stdc++.h>
#define endl '\n'
typedef long long ll;
 
using namespace std;
 
const ll maxn = 2e5 + 7;
const ll mod = 1e9 + 7;

ll dp[maxn][2];
ll a[maxn];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    
    ll n;
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
    	cin >> a[i];
	}
	
	if(n == 1)cout << a[1] << endl;
	else
	{
		ll ma = 0;
		dp[2][0] = 0;
		dp[2][1] = a[2];
		for(int i = 3; i <= n; i ++)
		{
			dp[i][0] = max(dp[i - 1][0],dp[i - 1][1]);
			dp[i][1] = max(dp[i - 1][0] + a[i],a[i]); 
	 	}
		ma = max(dp[n][0],dp[n][1]);
		
		memset(dp,0,sizeof(dp));
		dp[1][0] = 0;
		dp[1][1] = a[1];
		a[2] = 0;
		for(int i = 2; i <= n - 1; i ++)
		{
			dp[i][0] = max(dp[i - 1][0],dp[i - 1][1]);
			dp[i][1] = max(dp[i - 1][0] + a[i],a[i]); 
	 	}
		ma = max(max(dp[n - 1][0],dp[n - 1][1]),ma);
		
		cout << ma << endl;
	}
	return 0;
}