zoukankan      html  css  js  c++  java
  • hduoj1025——dp, lis

    hduoj1025——dp, lis

    Constructing Roads In JGShining's Kingdom

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 17424    Accepted Submission(s): 4946


    Problem Description
    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. ^_^
     
    Input
    Each 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.
     
    Output
    For 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.
     
     
    题意:不解释了
    思路:本来以为是lcs,不过题目数据太大,n^2肯定过不去,原来排序后lcs可转化为lis。。。这样就可以用nlogn过了
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<algorithm>
    
    using namespace std;
    
    const int maxn=1000010;
    int n;
    struct city
    {
        int a,b;
        friend bool operator<(city a,city b)
        {
            return a.b<b.b;
        }
    };city a[maxn];
    int d[maxn];
    
    int BinSearch(int *a,int left,int right,int key)
    {
        while(left<right){
            int mid=(left+right)/2;
            if(a[mid]<key&&a[mid+1]>=key) return mid;
            if(a[mid]>=key) right=mid;
            else left=mid+1;
        }
        return 0;
    }
    
    int lis(city *a,int n,int *d)
    {
        int len=1;
        d[1]=a[0].a;
        for(int i=1;i<n;i++){
            if(a[i].a>d[len]) d[++len]=a[i].a;
            else{
                int k=BinSearch(d,1,len,a[i].a);///二分查找求第一个比a[i]小的数的下标
                d[k+1]=a[i].a;
            }
        }
        return len;
    }
    
    int main()
    {
        int tag=1;
        while(cin>>n){
            for(int i=0;i<n;i++){
                scanf("%d%d",&(a[i].a),&(a[i].b));
            }
            sort(a,a+n);
            int ans=lis(a,n,d);
            printf("Case %d:
    ",tag++);
            if(ans<=1) printf("My king, at most %d road can be built.
    
    ",ans);
            else printf("My king, at most %d roads can be built.
    
    ",ans);
        }
        return 0;
    }
    View Code
    没有AC不了的题,只有不努力的ACMER!
  • 相关阅读:
    MySQL数据库基准压力测试工具之MySQLSlap使用实例
    WPF水珠效果按钮组
    获取用户Ip地址通用方法常见安全隐患(HTTP_X_FORWARDED_FOR)
    leaflet的入门开发(一)
    linux 安装pip 和python3
    python模拟Get请求保存网易歌曲的url
    Phalcon 上下文编码(Contextual Escaping)
    (七十七)地理编码与反地理编码
    设计模式简单介绍
    windows下安装Jenkins
  • 原文地址:https://www.cnblogs.com/--560/p/4354858.html
Copyright © 2011-2022 走看看