HDU 1176 - Free Pancake
Problem : N pancake will fall down, each will fall down on the ground on time t[i] and position x (1<=t[i]<=10^5, 0<=x<=10). Start at position 5, How many pancake can be get at maximum.
Solution : Let f[i][j] to be at time i and position j the maximum pancake can be get. then f[i][j]=max(f[i-1][j-1], f[i-1][j], f[i-1][j+1])+num[i][j].
HDU 1203 - I NEED A OFFER!
Problem : N schools, each has cost a[i] and success probability b[i]. Given M money, get the maximum possibility to get an offer. (1<=N, M<=10000).
Solution : Raw Knapsack. Though N and M is said to be 10000, but their product seems always smaller than 10^6.
Merge branch 'master' of git@github.com:MissAmour/KrwlngsACMFile