zoukankan      html  css  js  c++  java
  • D. Mysterious Present (看到的一个神奇的DP,也可以说是dfs)

    D. Mysterious Present
    time limit per test
    2 seconds
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    Peter decided to wish happy birthday to his friend from Australia and send him a card. To make his present more mysterious, he decided to make a chain. Chain here is such a sequence of envelopes A = {a1,  a2,  ...,  an}, where the width and the height of the i-th envelope is strictly higher than the width and the height of the (i  -  1)-th envelope respectively. Chain size is the number of envelopes in the chain.

    Peter wants to make the chain of the maximum size from the envelopes he has, the chain should be such, that he'll be able to put a card into it. The card fits into the chain if its width and height is lower than the width and the height of the smallest envelope in the chain respectively. It's forbidden to turn the card and the envelopes.

    Peter has very many envelopes and very little time, this hard task is entrusted to you.

    Input

    The first line contains integers nwh (1  ≤ n ≤ 50001 ≤ w,  h  ≤ 106) — amount of envelopes Peter has, the card width and height respectively. Then there follow n lines, each of them contains two integer numbers wi and hi — width and height of the i-th envelope (1 ≤ wi,  hi ≤ 106).

    Output

    In the first line print the maximum chain size. In the second line print the numbers of the envelopes (separated by space), forming the required chain, starting with the number of the smallest envelope. Remember, please, that the card should fit into the smallest envelope. If the chain of maximum size is not unique, print any of the answers.

    If the card does not fit into any of the envelopes, print number 0 in the single line.

    Sample test(s)
    input
    2 1 1
    2 2
    2 2
    output
    1
    1
    input
    3 3 3
    5 4
    12 11
    9 8
    output
    3
    1 3 2


     1 #include <iostream>
     2 #include <string.h>
     3 #include <stdio.h>
     4 #include <algorithm>
     5 using namespace std;
     6 typedef struct abcd
     7 {
     8     int x,y,z,t;
     9 } abcd;
    10 abcd a[5010];
    11 int n;
    12 int dfs(int x)
    13 {
    14     if(a[x].z!=-1)return a[x].z;
    15     a[x].z=0;
    16     for(int i=0; i<=n; i++)
    17     {
    18         if(a[x].x<a[i].x&&a[x].y<a[i].y)
    19         {
    20             if(dfs(i)+1>a[x].z)
    21                 a[x].z=dfs(i)+1,a[x].t=i;
    22         }
    23     }
    24     return a[x].z;
    25 }
    26 int main()
    27 {
    28     int i,j,m=0;
    29     cin>>n;
    30     for(i=0; i<=n; i++)
    31     {
    32         scanf("%d%d",&a[i].x,&a[i].y);
    33         a[i].t=-1,a[i].z=-1;
    34     }
    35     dfs(0);
    36     cout<<a[0].z<<endl;
    37     i=0;
    38     while(a[i].t!=-1)
    39     {
    40         if(i!=0)
    41             cout<<" ";
    42         cout<<a[i].t;
    43         i=a[i].t;
    44     }
    45     cout<<endl;
    46 }
    View Code
  • 相关阅读:
    生产者消费者模型
    varchar2存储汉字,英文字符,数字在oracle中的多少
    正则表达式以及邮箱
    爬虫
    创建git本地仓库和GitHub远程仓库并配置连接的从无到有
    CSSHTML实现高度宽度自适应
    实现一个元素在当前窗口垂直水平居中的几种方法
    angular4 rxjs 异步处理多个http请求数据
    angular 4 父子组件异步交互
    同步异步单线程多线程初级理解
  • 原文地址:https://www.cnblogs.com/ERKE/p/3587152.html
Copyright © 2011-2022 走看看