zoukankan      html  css  js  c++  java
  • HDU1160(KB12-J DP)

    FatMouse's Speed

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 15801    Accepted Submission(s): 6969
    Special Judge


    Problem Description

    FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the speeds are decreasing.
     

    Input

    Input contains data for a bunch of mice, one mouse per line, terminated by end of file.

    The data for a particular mouse will consist of a pair of integers: the first representing its size in grams and the second representing its speed in centimeters per second. Both integers are between 1 and 10000. The data in each test case will contain information for at most 1000 mice.

    Two mice may have the same weight, the same speed, or even the same weight and speed. 
     

    Output

    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 a mouse). If these n integers are m[1], m[2],..., m[n] then it must be the case that 

    W[m[1]] < W[m[2]] < ... < W[m[n]]

    and 

    S[m[1]] > S[m[2]] > ... > S[m[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 speeds 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
     

    Source

     
     1 //2017-04-04
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 struct node
    10 {
    11     int w, s, pos;
    12     bool operator<(node x)
    13     {
    14         return w < x.w;
    15     }
    16 }mice[1005];
    17 int dp[1005], pre[1005];//dp[i]表示前i只老鼠的最长下降子序列
    18 
    19 void print(int pos)
    20 {
    21     if(pos == -1)return ;
    22     print(pre[pos]);
    23     printf("%d
    ", mice[pos].pos);
    24 }
    25 
    26 int main()
    27 {
    28     int n = 0, w, s;
    29     memset(pre, -1, sizeof(pre));
    30     while(scanf("%d%d", &w, &s)!=EOF)
    31     {
    32         mice[n].w = w;
    33         mice[n].s = s;
    34         mice[n].pos = n+1;
    35         n++;
    36     }
    37     sort(mice, mice+n);
    38     int pos = -1, mx = 0;
    39     for(int i = 0; i < n; i++){
    40         dp[i] = 1;
    41         for(int j = 0; j < i; j++){
    42             if(mice[j].w < mice[i].w && mice[j].s > mice[i].s){
    43                 if(dp[j]+1 > dp[i]){
    44                     dp[i] = dp[j]+1;
    45                     pre[i] = j;
    46                 }
    47             }
    48         }
    49         if(dp[i] > mx){
    50             mx = dp[i];
    51             pos = i;
    52         }
    53     }
    54     printf("%d
    ", mx);
    55     print(pos);
    56     return 0;
    57 }
  • 相关阅读:
    课程作业03-1
    课程作业02
    课程作业01:模仿JavaAppArguments.java示例,编写一个程序,此程序从命令行接收多个数字,求和之后输出结果。
    《大道至简》第一章读后感,伪代码
    《美国教授写给被开除中国留学生的信》阅读笔记
    《大道至简》读后感
    《需求工程——软件建模与分析》阅读笔记02
    《需求工程——软件建模与分析》阅读笔记01
    微信小游戏开发笔记03
    微信小游戏开发笔记02
  • 原文地址:https://www.cnblogs.com/Penn000/p/6665217.html
Copyright © 2011-2022 走看看