zoukankan      html  css  js  c++  java
  • UVA 10131 Is Bigger Smarter?(DP最长上升子序列)

    Description

    Download as PDF
     

    Question 1: Is Bigger Smarter?

    The Problem

    Some people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take the data on a collection of elephants and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the IQ's are decreasing.

    The input will consist of data for a bunch of elephants, one elephant per line, terminated by the end-of-file. The data for a particular elephant will consist of a pair of integers: the first representing its size in kilograms and the second representing its IQ in hundredths of IQ points. Both integers are between 1 and 10000. The data will contain information for at most 1000 elephants. Two elephants may have the same weight, the same IQ, or even the same weight and IQ.

    Say that the numbers on the i-th data line are W[i] and S[i]. Your program should output a sequence of lines of data; the first line should contain a number n; the remaining n lines should each contain a single positive integer (each one representing an elephant). If these nintegers are a[1]a[2],..., a[n] then it must be the case that

       W[a[1]] < W[a[2]] < ... < W[a[n]]
    
    and
       S[a[1]] > S[a[2]] > ... > S[a[n]]
    
    In order for the answer to be correct, n should be as large as possible. All inequalities are strict: weights must be strictly increasing, and IQs must be strictly decreasing. There may be many correct outputs for a given input, your program only needs to find one.

    Sample Input

    6008 1300
    6000 2100
    500 2000
    1000 4000
    1100 3000
    6000 2000
    8000 1400
    6000 1200
    2000 1900
    

    Sample Output

    4
    4
    5
    9
    7
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 using namespace std;
     6 
     7 const int maxn=1005;
     8 int d[maxn],pre[maxn],n;
     9 
    10 struct node
    11 {
    12     int x,y,id;
    13 }p[maxn];
    14 
    15 bool mycomp(node a,node b)
    16 {
    17     if(a.x!=b.x) return a.x<b.x;
    18     return a.y>b.y;
    19 }
    20 
    21 void printf_ans(int n,int i)
    22 {
    23     if(n==0) return ;
    24     int u=pre[i];
    25     printf_ans(n-1,u);
    26     printf("%d
    ",p[i].id);
    27 }
    28 
    29 bool judge(int j,int i)
    30 {
    31     if(p[j].x<p[i].x&&p[j].y>p[i].y)
    32         return true;
    33     return false;
    34 }
    35 
    36 int main()
    37 {
    38     int i,j;n=1;
    39     while(~scanf("%d%d",&p[n].x,&p[n].y))
    40     {
    41         p[n].id=n;n++;
    42     }
    43     n--;
    44     sort(p+1,p+n+1,mycomp);
    45     memset(pre,-1,sizeof(pre));
    46     memset(d,0,sizeof(d));
    47     p[0].x=-100000;p[0].y=100000;
    48     for(i=1;i<=n;i++)
    49     {
    50         for(j=0;j<i;j++)
    51         {
    52             if(judge(j,i) && d[i]<d[j]+1)
    53             {
    54                 d[i]=d[j]+1;pre[i]=j;
    55             }
    56         }
    57     }
    58     int ansm,ansi;
    59     for(i=1;i<=n;i++)
    60     {
    61         if(ansm<d[i])
    62         {
    63             ansm=d[i];ansi=i;
    64         }
    65     }
    66     printf("%d
    ",ansm);
    67     printf_ans(ansm,ansi);
    68     return 0;
    69 }
  • 相关阅读:
    django中itsdangerous的用法
    Django之跨域请求同源策略
    django中如何建立抽象型数据库作为父模块可继承其功能
    cookie,session 的概念以及在django中的用法,以及cbv装饰器用法
    django开发日志配置
    RESTful API概念解析
    django Rest Framework---缓存通过drf-extensions扩展来实现
    匿名内部类
    android app出现红叉
    Failed to resolve: com.android.support:appcompat-v7:27.+
  • 原文地址:https://www.cnblogs.com/xiong-/p/3894431.html
Copyright © 2011-2022 走看看