- 博客(5)
- 收藏
- 关注
RSS订阅原创 uva 11997
K Smallest Sums You're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k sma
2013-09-24 21:36:10
557
原创 uva11991
Easy Problem from Rujia Liu? Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia L
2013-09-24 20:16:30
594
原创 uva 11995 STL模拟
记住 在pop之前 要先判断 是否 empty。runtime error 了 三次。 #include #include #include #include using namespace std; stack st; queue qu; priority_queue p_max; //priority_queue , greater > p_min; int flag_
2013-09-24 19:18:18
558
原创 windows程序设计 学习记录1
#include int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLine, int iCmdShow) { MessageBox(NULL,TEXT("Hello Windows 98!"), TEXT("HelloMsg") , 0 ); return
2013-09-14 11:59:44
414
原创 POJ 1191
最优连通子集，对于所要求的方差，展开，化简变成求大矩形分成n块，各块之和的平方的和的最小值，用记忆化搜索模拟每次切割的选择。 #include #include #include #include #include using namespace std; #define M 8 #define N 15 #define inf 10000000 int dp[M*M][M*
2013-09-06 20:50:48
458
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人