可能大家多用的是dp,这里说种其他方法
2111221把这种序列用最少次数变成1111222这种
思路
1.按顺序统计当前1的个数和2的个数。
2.计算从当前位置改,前面会有多少个2被改,当前位置后面有多少个1也会被改。for一遍求最小。
3.得到的答案与1的总数和2的总数进行一次比较!!有卡这一条的数据
number:2 1 1 1 2 2 1
sum2 :1 1 1 1 2 3 3
sum1 :0 1 2 3 3 3 4
change:5 4 3 2 3 4 3
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A,B)memcpy(A,B,sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const LL INFF=0x3f3f3f3f3f3f3f3fLL;
const double EPS=1e-9;
const double OO=1e20;
const double PI=acos (-1.0);
int dx[]= {0,1,0,-1};
int dy[]= {1,0,-1,0};
int gcd (const LL &a,const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
const int maxn=30030;
int sum1[maxn],sum2[maxn];
int main() {
int n,num;
while (~scanf ("%d",&n) ) {
memset (sum1,0,sizeof (sum1) );
memset (sum2,0,sizeof (sum2) );
int t1=0,t2=0;int ans=INF;
for (int i=1; i<=n; i++) {
scanf ("%d",&num);
(num==1)?sum1[i]=++t1:sum1[i]=t1;/***/
(num==2)?sum2[i]=++t2:sum2[i]=t2;
}
for (int i=1; i<n; i++) {
ans=min (ans,sum2[i]+ (sum1[n]-sum1[i])/*!!*/ );
}
ans=min (ans,sum1[n]);/***/
ans=min (ans,sum2[n]);/***/
printf ("%d\n",ans);
}
return 0;
}