[機率dp] ZOJ 3822 Domination,zoj3822題意:給N×M的棋盤,每天隨機找一個沒放過棋子的格子放一個棋子問使得每個每列都有棋子的天數期望思路:dp[i][j][k] 代表放了i個棋子佔了j行k列 到達目標狀態的期望然後從 dp[n*m][n][m] 往後遞推就好了。因為知道了有i個棋子 例如一個狀態dp[6][3][3]x x x o o ox o o o o ox o x o o oo o o o o o對於 dp[i+1][3][3]
ZOJ3822 ACM-ICPC 2014 亞洲地區賽牡丹江賽區現場賽D題Domination 機率DP,zoj3822acm-icpcDominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headmaster of Marjar
HDU 3265 Posters(線段樹),hdu3265HDU 3265 Posters題目連結題意:給定一些矩形海報,中間有孔,求貼海報的之後的海報覆蓋面積並思路:海報一張可以切割成4個矩形,然後就是普通的矩形面積並了,利用線段樹維護即可代碼:#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int N
2014ACM/ICPC亞洲地區賽牡丹江站現場賽-K ( ZOJ 3829 ) Known Notation,2014acmicpcKnown NotationTime Limit: 2 Seconds Memory Limit: 65536 KBDo you know reverse Polish notation (RPN)? It is a known notation in the area of
poj1276--Cash Machine(多重背包判可達),poj1276Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27804 Accepted: 9915DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to