Humble Numbers HDU - 1058 2分dp

JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines. 

Half of these cities are rich in resource (we call them rich cities) while the others are short of resource (we call them poor cities). Each poor city is short of exactly one kind of resource and also each rich city is rich in exactly one kind of resource. You may assume no two poor cities are short of one same kind of resource and no two rich cities are rich in one same kind of resource. 

With the development of industry, poor cities wanna import resource from rich ones. The roads existed are so small that they're unable to ensure the heavy trucks, so new roads should be built. The poor cities strongly BS each other, so are the rich ones. Poor cities don't wanna build a road with other poor ones, and rich ones also can't abide sharing an end of road with other rich ones. Because of economic benefit, any rich city will be willing to export resource to any poor one. 

Rich citis marked from 1 to n are located in Line I and poor ones marked from 1 to n are located in Line II. 

The location of Rich City 1 is on the left of all other cities, Rich City 2 is on the left of all other cities excluding Rich City 1, Rich City 3 is on the right of Rich City 1 and Rich City 2 but on the left of all other cities ... And so as the poor ones. 

But as you know, two crossed roads may cause a lot of traffic accident so JGShining has established a law to forbid constructing crossed roads. 

For example, the roads in Figure I are forbidden. 



In order to build as many roads as possible, the young and handsome king of the kingdom - JGShining needs your help, please help him. ^_^ 

InputEach test case will begin with a line containing an integer n(1 ≤ n ≤ 500,000). Then n lines follow. Each line contains two integers p and r which represents that Poor City p needs to import resources from Rich City r. Process to the end of file. 
OutputFor each test case, output the result in the form of sample. 
You should tell JGShining what's the maximal number of road(s) can be built. 
Sample Input

2
1 2
2 1
3
1 2
2 3
3 1

Sample Output

Case 1:
My king, at most 1 road can be built.

Case 2:
My king, at most 2 roads can be built.


        
 

Hint

Huge input, scanf is recommended.


二分加dp
dp[i]表示第i个上升子序列的最小值；
num[i]
dp[1]
dp[2]
dp[3]
dp[4]
然后去找到num[i]
在的位子用2分

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int num[100000];
int n;
int dp[100000];
struct node
{
    int a,b;
}lu[1000000];
int main()
{
    int k=0;
  while(~scanf("%d",&n))
  {
      for(int i=1;i<=n;i++)
      {
      scanf("%d%d",&lu[i].a,&lu[i].b);
      num[lu[i].a]=lu[i].b;
      }
      memset(dp,0,sizeof dp);
      int res=0;
      for(int i=1;i<=n;i++)
      {
          if(num[i]>dp[res])
          {
              dp[++res]=num[i];
          }
          else
          {
              int l=1,r=res;
              while(res>=l)
              {
                  int mid=(r+l)/2;
                  if(num[i]>dp[mid]&&num[i]<=dp[mid+1])
                  {
                      dp[mid+1]=num[i];
                      break;
                  }
                  else if(num[i]<=dp[mid])
                  {
                      r=mid-1;
                  }
                  else
                    l=mid+1;

              }
          }
      }
      if(res==1)
        printf("Case %d:\nMy king, at most %d road can be built.\n",++k,res);
        else
            printf("Case %d:\nMy king, at most %d roads can be built.\n",++k,res);
        printf("\n");

  }
   return 0;
}

 

转载于:https://www.cnblogs.com/2014slx/p/7306665.html