#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<string>
using namespace std;
typedef struct sticks {
   int x;
   int y;
}stick;
stick aa[5000];
int compare_x( const void* a, const void* b ) {
   stick* arg1 = (stick*) a;
   stick* arg2 = (stick*) b;
   if( arg1->x < arg2->x ) return -1;
   else if( arg1->x == arg2->x ) 
    return arg1->y-arg2->y;
   else return 1;
 }
 int compare_y( const void* a, const void* b ) {
   stick* arg1 = (stick*) a;
   stick* arg2 = (stick*) b;
   if( arg1->y < arg2->y ) return -1;
   else if( arg1->y == arg2->y )
     return arg1->x-arg2->x;
   else return 1;
 }

int main()
{
 int M;
 int Tcase;
 cin>>Tcase;
 while(Tcase-->0)
 {
   cin>>M;
   for(int i=0;i<M;i++)
     cin>>aa[i].x>>aa[i].y;
   qsort(aa,M,sizeof(stick),compare_x);
   int sum1=0;
   for(int i=0;i<M-1;i++)
   {
     if(aa[i].y>aa[i+1].y)
	    sum1++;
   }
   qsort(aa,M,sizeof(stick),compare_y);
   int sum2=0;
   for(int i=0;i<M-1;i++)
   {
     if(aa[i].x>aa[i+1].x)
	   sum2++;
   }
   
   if(sum1>sum2)
     cout<<sum2+1<<endl;
	else
	 cout<<sum1+1<<endl;
 }
 return 0;
}

• Re:按l和w排序两次,取最小的sum,有问题吗? (1554) HouXran 2007-05-22 21:55:16
  • Re:按l和w排序两次,取最小的sum,有问题吗? (34) zyfans 2007-08-16 19:02:44
• Re:按l和w排序两次,取最小的sum,有问题吗? (32) damagegod 2008-01-22 19:37:03
  • Re:按l和w排序两次,取最小的sum,有问题吗? (60) ccnujing 2008-03-23 17:19:49
• Re:我也错了!!同样的方法!! (5) Blue_Ant 2008-05-08 19:31:07