Wooden Stichs(P1065)

这个题有一个细节又没有想到：就是每一次有一个新的棍子加入后都要把当前的长度更新一次。

下面是同一种方法的两种写法在同一个程序里：

#include<iostream>
#include<cstdio>
#include<cstring> 
#include<ctype.h>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<set>
#include<string>
#include<map>
#include<stack>
using namespace std; 

struct my
{
	int x,y;
	my(int a=3,int b=3)
	{
		x=a;
		y=b;
	}
};

bool cmp(my a,my b)
{
	if (a.x!=b.x)
		return a.x<b.x;
	return a.y<b.y;
}

void tanxin(vector<my> go)
{
	int i,j,temp;
	int mark[10000];
	memset(mark,0,sizeof(mark));
	int total=0;
	for(i=0;i<go.size();i++)
		if(mark[i]==0)
		{
			temp=go[i].y;
			for(j=i+1;j<go.size();j++)
			{
				if(go[j].y >=temp&&mark[j]==0)
				{
					temp=go[j].y;
					mark[j]=1;
				}
			}
			total++;
		}
	cout<<total<<endl;
}

int main()
{
	int i,j,k;
	
	vector<my> go;
	int n;
	int t;
	cin>>t;
	while (t--)
	{
		cin>>n;
		go.clear();
		while (n--)
		{
			scanf("%d%d",&i,&j);

		
			go.insert(go.end(),my(i,j));
		}
		sort(go.begin(),go.end(),cmp);

        if (0)
			tanxin(go);
		else
		{
		i=0;
		int ans=0;
		k=go[i].y;
		while (go.size())
		{
			i=0;
			k=go[i].y;
			while (i<go.size())
			{
				if (k<=go[i].y)
				{
					k=go[i].y;
					go.erase(go.begin()+i);

					
				}
				else
					i++;
			}
			ans++;
			//cout<<go.size()<<endl;
		}
		cout<<ans<<endl;
	}
	}
	return 0;
}

Wooden Sticks

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14538		Accepted: 5933

Description

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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1 <= n <= 5000 , that represents the number of wooden sticks in the test case, and the second line contains 2n positive integers l1 , w1 , l2 , w2 ,..., ln , wn , each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.

Output

The output should contain the minimum setup time in minutes, one per line.

Sample Input

3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1 

Sample Output

2
1
3

Source

Taejon 2001