题目链接:https://codeforces.com/contest/1114/problem/D
题意:给定序列ai,定义一个区间联通当且仅当区间内所有数相同,给定操作如下:开始选定一个起点S(不变且不计入操作数),每次操作可以将包含S在内的联通区间内的所有数变为其他任意一个数,求最小操作数使整个序列内的数相同;
解法:DP
首先需要明确的是若区间[ l,r ]经过k次操作后变成联通区间,则其内数均变为a[ l ]或a[ r ];
定义dp[ i ][ j ]为区间[ i , j ]联通后其内数为a[ j ]的最小操作数;
则状态转移方程:
dp[ i ][ j ]=min(dp[ i ][ j-1 ]+(a[ j-1 ] != a[ j ]) , dp[ j-1 ][ i ]+(a[ i ] != a[ j ]))
dp[ j ][ i ]=min(dp[ j ][ i+1 ]+(a[ i+1] != a[ i ]), dp[ i+1 ][ j ]+(a[ j ] !=a[ i ]))
附代码:
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mem(a,b) memset(a,b,sizeof(a))
#define per(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,a,b) for(int i=(a);i>=(b);i--)
#define pi acos(-1.0)
#define inf 0x3f3f3f3f
#define Rand() (rand()|rand()<<15)
#define Srand() srand(time(0)^(unsigned)(unsigned long long)(new char))
#define typemax(type) numeric_limits<type>::max()
#define typemin(type) numeric_limits<type>::min()
typedef long long ll;
template<typename T> inline void read(T &x) {x = 0;int f = 1;char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}x=x*f;}
template<typename E> E gcd(E a,E b){return b==0?a:gcd(b,a%b);}
template<typename E> E ex_gcd(E a,E b,E &x,E&y) {if(b==0){x=1;y=0;}else {ex_gcd(b,a%b,y,x);y-=(a/b)*x;}}
template<typename E> E quick_pow(E a,E b,E c){E ans=1;while(b){if(b&1) ans=ans*a%c;a=a*a%c;b>>=1;}return ans;}
template<typename E> E inv1(E a,E b){return quick_pow(a,b-2,b);}
template<typename E> E inv2(E a,E b){E x,y;ex_gcd(a,b,x,y);return (x%b+b)%b;}
/*==================================Header Template=============================================*/
const double eps=1.0e-5;
const int maxn=5005;
const ll mod=1e9+7;
int n,b[maxn],dp[maxn][maxn],len=0;
int main()
{
scanf("%d",&n);
per(i,1,n) scanf("%d",&b[i]);
for(int i=1;i<=n;i++){
for(int j=1;j+i<=n;j++){
dp[j][j+i]=min(dp[j][j+i-1]+(b[j+i-1]!=b[j+i]),dp[j+i-1][j]+(b[j]!=b[j+i]));
dp[j+i][j]=min(dp[j+i][j+1]+(b[j+1]!=b[j]),dp[j+1][j+i]+(b[j]!=b[j+i]));
}
}
printf("%d\n",min(dp[1][n],dp[n][1]));
}