[codeforces 1287C] Garland 动归dp
总目录详见https://blog.csdn.net/mrcrack/article/details/103564004
在线测评地址http://codeforces.com/contest/1287/problem/C
Problem | Lang | Verdict | Time | Memory |
---|---|---|---|---|
C - Garland | GNU C++11 | Accepted | 31 ms | 0 KB |
动归如何想,以下是一点想法:
就该题而言,还是要从模拟入手,处理第1位,处理第2位,处理第3位
会遇到几个状态,1当前处理长度;2当前处理完后,剩下的奇数,偶数的个数;3当前位是奇数,还是偶数,因其会影响计数情况。
此文https://www.cnblogs.com/c4Lnn/p/12163898.html思路不错,摘抄如下
思路二:dp
一维:长度,二维:剩余偶数个数,三维:当前数奇偶性
界限:
当存在偶数且第一个数为0或偶数:dp[1][n/2−1][0]=0
当第一个数为 0 或奇数:dp[1][n/2][1]=0
状态转移:
①当前填偶数:dp[i][j−1][0]=min(dp[i][j−1][0],dp[i−1][j][k]+(k==1))
②当前填奇数:dp[i][j][1]=min(dp[i][j][1],dp[i−1][j][k]+(k==1))
就看题过程中,还是出现了误解,该题的核心在于
In the first example, one should place light bulbs as 1 5 4 2 3. In that case, the complexity would be equal to 2, because only (5,4) and (2,3) are the pairs of adjacent bulbs that have different parity.
觉得此句多余Vadim defines complexity of a garland to be the number of pairs of adjacent bulbs with numbers with different parity (remainder of the division by 2).
(remainder of the division by 2)是修饰parity的,英文总归要多读多练。
#include <stdio.h>
#include <string.h>
#define N 105
int dp[N][N][2],a[N];
int min(int a,int b){
return a<b?a:b;
}
int main(){
int i,j,k,n;
memset(dp,127,sizeof(dp));
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
//第1位处理
if(a[1]==0||a[1]%2==1)dp[1][n/2][1]=0;//第1位放奇数
if(n/2>0&&(a[1]==0||a[1]%2==0))dp[1][n/2-1][0]=0;//第1位放偶数
for(i=2;i<=n;i++)
for(j=0;j<=n/2;j++)
for(k=0;k<2;k++){
if(a[i]==0||a[i]%2==1)dp[i][j][1]=min(dp[i][j][1],dp[i-1][j][k]+(k==0));//第i位放奇数
if(j>0&&(a[i]==0||a[i]%2==0))dp[i][j-1][0]=min(dp[i][j-1][0],dp[i-1][j][k]+(k==1));//此处错写成if(j>0&&(a[i]==0||a[i]%2==0))dp[i][j][0]=min(dp[i][j][0],dp[i-1][j+1][k]+(k==1));//第i位放偶数
}
printf("%d\n",min(dp[n][0][0],dp[n][0][1]));
return 0;
}