C. Garland(记搜版本)

https://codeforces.com/contest/1287/problem/C

---

思路：上次是用递推做的..这一次用记忆化做。两者感觉有一点不同，记搜来说代码可以更简短一点，而且是对于当前的状态，暴力dfs跑完之后可能的所有状态，然后回来的时候把最优答案比较出来然后记住。和

下面这个传送的先处理好边界然后再跑各有妙处。

传送

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e2+10;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL dp[maxn][3][maxn][maxn];
LL a[maxn],n;
LL dfs(LL pos,LL lastval,LL num1,LL num2){///当前位置,当前还剩的num1个奇，num2个偶数且上一个位置放奇/偶
      if(pos==n+1) return 0;
      if(dp[pos][lastval][num1][num2]!=-1) return dp[pos][lastval][num1][num2];
      if(a[pos]){
         if(a[pos]&1){
            if(lastval==0) return dfs(pos+1,1,num1,num2)+1;
            else return dfs(pos+1,1,num1,num2);
         }
         else{
            if(lastval==1) return dfs(pos+1,0,num1,num2)+1;
            else return dfs(pos+1,0,num1,num2);
         }
      }
      else{
         LL minv=1e9;
         if(lastval==0){
            if(num1) minv=min(minv,dfs(pos+1,1,num1-1,num2)+1);
            if(num2) minv=min(minv,dfs(pos+1,0,num1,num2-1));
         }
         else if(lastval==1){
            if(num1) minv=min(minv,dfs(pos+1,1,num1-1,num2));
            if(num2) minv=min(minv,dfs(pos+1,0,num1,num2-1)+1);
         }
         else{
            if(num1) minv=min(minv,dfs(pos+1,1,num1-1,num2));
            if(num2) minv=min(minv,dfs(pos+1,0,num1,num2-1));
         }
         dp[pos][lastval][num1][num2]=minv;
         return minv;
      }
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   cin>>n;
   LL num1=n/2+n%2;LL num2=n/2;
   memset(dp,-1,sizeof(dp));
   for(LL i=1;i<=n;i++){
       cin>>a[i];
       if(a[i]&&(a[i]&1)) num1--;
       else if(a[i]&&(a[i]%2==0)) num2--;
   }
   cout<<dfs(1,2,num1,num2)<<"\n";
   return 0;
}