1221D - Make The Fence Great Again

篱笆最多修2次，多了没必要

因为每个篱笆只跟周围2个有关，枚举所有情况发现，篱笆最多只需要修2次。

然后直接2维DP下去就行，DP真是暴力无脑，简单粗暴

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
#define F first
#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const int seed=131;
const int M = 3e5+7;
ll a[M],b[M];
ll dp[M][3];//第i块木板修j次所需的花费最小 
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int t,n;
  	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)
			cin>>a[i]>>b[i];
		for(int i=1;i<=n;i++)
		for(int j=0;j<=2;j++)
			dp[i][j]=2e18+7;
		dp[1][0]=0;
		dp[1][1]=b[1];
		dp[1][2]=b[1]*2;
		for(int i=2;i<=n;i++)
		{
			if(a[i]==a[i-1])
			{
				dp[i][0]=min(dp[i-1][1],dp[i-1][2]);
				dp[i][1]=min(dp[i-1][0],dp[i-1][2])+b[i];
				dp[i][2]=min(dp[i-1][0],dp[i-1][1])+2*b[i];
			}
			else if(a[i]==a[i-1]-1)
			{
				dp[i][0]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0]);
				dp[i][1]=min(dp[i-1][1],dp[i-1][2])+b[i];
				dp[i][2]=min(dp[i-1][0],dp[i-1][2])+b[i]*2;
			}
			else if(a[i]==a[i-1]-2)
			{
				dp[i][0]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0]);
				dp[i][1]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+b[i];
				dp[i][2]=min(dp[i-1][1],dp[i-1][2])+b[i]*2;
			}
			else if(a[i]==a[i-1]+1)
			{
				dp[i][0]=min(dp[i-1][0],dp[i-1][2]);
				dp[i][1]=min(dp[i-1][0],dp[i-1][1])+b[i];
				dp[i][2]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+2*b[i];
			}
			else if(a[i]==a[i-1]+2)
			{
				dp[i][0]=min(dp[i-1][0],dp[i-1][1]);
				dp[i][1]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+b[i];
				dp[i][2]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+2*b[i];
			}
			else
			{
				dp[i][0]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0]);
				dp[i][1]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+b[i];
				dp[i][2]=min(min(dp[i-1][1],dp[i-1][2]),dp[i-1][0])+2*b[i];
			}
		}
		cout<<min(min(dp[n][1],dp[n][2]),dp[n][0])<<endl;
	}
	
	  
	return 0;
}
/*
54489
84
3 226708014
1 116619851
1 294761
3 123122653
3 202090436
2 202855076
3 171661263
1 110351146
5
3 31234563
1 25034262
1 11647778
2 34799698
1 8381348
5
2 602040711
2 149599657
3 2314209
2 516170455
1 112036237
8
3 30340023
1 127257304
3 162843600
1 342986469
3 296890133
1 480980337
4 256297204
4 432785734
5
2 259249630
4 651592825
1 274461316
4 206959523
2 5961951

*/

下面这样写更优雅

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
#define F first
#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const int seed=131;
const int M = 3e5+7;
ll a[M],b[M];
ll dp[M][3];//第i块木板修j次所需的花费最小 
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int t,n;
  	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)
			cin>>a[i]>>b[i];
		for(int i=1;i<=n;i++)
		for(int j=0;j<=2;j++)
			dp[i][j]=2e18+7;
		dp[1][0]=0;
		dp[1][1]=b[1];
		dp[1][2]=b[1]*2;
		for(int i=2;i<=n;i++)
		{
			for(int j=0;j<=2;j++)
			{
				for(int k=0;k<=2;k++)
				{
					if(a[i-1]+j!=a[i]+k)
					dp[i][k]=min(dp[i][k],dp[i-1][j]+k*b[i]); 
				}
			}
		}
		cout<<min(min(dp[n][1],dp[n][2]),dp[n][0])<<endl;
	}  
	return 0;
}