szhouan的博客

DescriptionChristine and Matt are playing an exciting game they just invented: the Number Game. The rules of this game are as follows. The players take turns choosing integers greater than 1. Fi

DescriptionYou want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many vases ordered in a row. Th

Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行) 原棋盘上每一格有一个分值，一块矩形棋盘的总分为其所含各格分值之和。现在需要把棋盘按上述规则分割成n块矩形棋盘，并使各矩形棋盘总分的均方差最小。 

题目链接：http://poj.org/problem?id=1192题意：给出一个由平面整点构成的树（两点相邻当且仅到曼哈顿距离为1），有N个点，每个点有权值。求这棵树的权值最大的子树（只求这个子树的权值）思路：用树上DP解决。称所要求的权值最大子树为“最大集”首先要把这个树看成一个有根树。对于每个节点，维护两个数，分别是该子树中最大集的权值，和包含当前这个节点的最大集的权值