04 2016 档案
摘要:题目利用DP思想,dp[i][j][k]表示robot跑到i行j列目前移动方向为k时,所需要的最小的flip。其中0 <= i <= N,0 <= j <= M,k = right/down dp[i][j][right] 可由dp[i][j-1][right]右移和dp[i-1][j][down]
阅读全文
摘要:Balanced Lineup Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides
阅读全文
摘要:最近感觉DP已经完全忘了..各种爆炸,打算好好复习一发,0-1背包开始 Big Event in HDU Problem Description Nowadays, we all know that Computer College is the biggest department in HDU.
阅读全文
摘要:Piggy-Bank 典型的完全背包问题,看是不是恰好把存钱罐装满,如果不装满的话dp[f]还是INF,转移方程是: dp[i] = min(dp[i], dp[i - w[j]] + p[j]); Problem Description Before ACM can do anything, a
阅读全文