摘要：分析：状态压缩DP。 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int w[2000],dp[1001][1<<11]; /*int sum(int x) { int ans=0; whil 阅读全文

摘要：Hie with the Pie Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8467 Accepted: 4628 Description The Pizazz Pizzeria prides itself in deliv 阅读全文

摘要：Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17742 Accepted: 9340 Description Farmer John has purchased a lush new rectangul 阅读全文