//592K 32MS C++#include #include #include using namespace std;long DP[16][9][9][9][9];int chess[8][8];long getSquareSum(int x1, int y1, in
//540K 32MS G++#include #include using namespace std;const int MAX = 155;int DPRemoveMin[MAX][MAX];int DPRemovNode { int par
// 1644K 16MS G++#include #include #include using namespace std;#define MAX_W 25#define MAX_W_NUM 20#define MAX_L 15
// 49424K 750MS G++#include #include using namespace std;#define MAX 5005short DP[MAX][MAX];// int DP[MAX];char stP)); for (in
// 252K 32MS C++#include #include #include #include #include #include using namespace std;const int MAX = 2005;//
//#include #include using namespace std;long long maxNum;int W;int H;#define NN (101)#define S (1<<9 + 1)int degree[13] = {0, 1, 2, 4 ,8, 16, 32, 64, 128,
//10344K 391MS C++#include #include #include const long long MAX = 100005;long long adjacentListHead[MAX];long long sNum;};long long
//264K 47MS C++#include #include #include const int MAX = 10005;long long cowLocation[10005];int cmp(con
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
