- 博客(3)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 poj 1458 C++解法
考察知识：动态规划 #include using namespace std; int c[1000][1000]; int lcs(char* x, char* y, int m, int n) { int i,j; for (i = 0; i < m; i++) c[i][0] = 0;
2012-03-09 10:40:39
824
原创 poj 1230 C++解法
考察点：贪心策略 思路：遍历每个column，如果这个column的wall数量n大于k，则抽掉其中n-k堵墙，抽掉墙的优先度按照墙横跨墙数超过k的column个数决定。 Source Code Problem: 1230 Memory: 328K Time: 0MS Language: C++ Result: Accepted Source Code #include
2012-03-09 10:33:49
390
北大ACM试题编号1017
Description
A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same height h as the products have and of the size 6*6. Because of the expenses it is the interest of the factory as well as of the customer to minimize the number of parcels necessary to deliver the ordered products from the factory to the customer. A good program solving the problem of finding the minimal number of parcels necessary to deliver the given products according to an order would save a lot of money. You are asked to make such a program.
2009-10-12
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人