原创 poj 2723 Get Luffy Out(圖論-2-sat)
Get Luffy Out Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7512 Accepted: 2855 Description Ratish
原创 hdu 2196 Computer(DP-樹形DP)
Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3152
原创 poj 2151 Check the difficulty of problems(概率DP)
Check the difficulty of problems Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4680 Accepted: 2049
原创 hdu 2222 Keywords Search(字符串匹配-AC自動機)
Keywords Search Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s
原创 hdu 4026 Unlock the Cell Phone(DP-狀態DP)
Unlock the Cell Phone Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submis
原创 poj 1160 Post Office(DP-簡單DP)
Post Office Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15380 Accepted: 8334 Description There i
原创 11795 - Mega Man's Mission(DP-狀態DP)
B Mega Man’s Missions Input Standard Input Output Standard Output Mega Man is off to save the world again
原创 hdu 4845 拯救大兵瑞恩(bfs)
拯救大兵瑞恩 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 51 Accepte
原创 poj 2112 Optimal Milking(spfa+二分+最大流)
Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 11975 Accepted: 4340 Case Time Limit:
原创 hdu Lawrence(DP-單調性優化-斜率優化)
Lawrence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2058
原创 uva 10290 - {Sum+=i++} to Reach N(數論-整數因子分解)
Problem H {sum+=i++} to Reach N Input: standard input Output: standard output Memory Limit: 32 MB All the positive n
原创 poj 2499 Binary Tree(水題)
Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5990 Accepted: 2774 Description Backgrou
原创 poj 2486 Apple Tree(DP-樹形DP)
Apple Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7114 Accepted: 2366 Description Wshxzt is
原创 poj 3709 K-Anonymous Sequence(DP-單調性優化-斜率優化)
#include <iostream> #include <cstdio> using namespace std; #define ll long long int const int maxn = 500010; ll dp[max
原创 hdu 1026 Ignatius and the Princess I(bfs)
Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total