寒假训练（2）——贪心 E - Wooden Sticks

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:

(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup.

You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).   

used 标记状态咯
struct Node
{
int l;
int w;
int used;
}node[5005];


for (i = 0; i < n; ++i) {//遍历这个数列中的每一个数

			if (node[i].vis == false) {//如果这一个数还没有被访问过
				node[i].vis = true;//那么将这个鼠标纪委已经访问
				ans++;//结果+1

				int weight = node[i].weight ;//标记当前的重量
				for (j = i + 1; j < n; ++j) {//扫描当前元素后面的所有元素
					//如果后面的元素没有被访问过&&后面的元素比当前元素的重量大 (因为排序以后长度默认已经是升序)
					if ((node[j].vis == false) && (node[j].weight >= weight)) {
						node[j].vis = true;//将该元素标记为已经访问过
						weight = node[j].weight;//并且更新当前的重量值
					}
				}
			}

		}