zoukankan      html  css  js  c++  java
  • POJ3263 Tallest Cow

    Tallest Cow
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 2368   Accepted: 1084

    Description

    FJ's N (1 ≤ N ≤ 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You are told only the height H (1 ≤ H ≤ 1,000,000) of the tallest cow along with the index I of that cow.

    FJ has made a list of R (0 ≤ R ≤ 10,000) lines of the form "cow 17 sees cow 34". This means that cow 34 is at least as tall as cow 17, and that every cow between 17 and 34 has a height that is strictly smaller than that of cow 17.

    For each cow from 1..N, determine its maximum possible height, such that all of the information given is still correct. It is guaranteed that it is possible to satisfy all the constraints.

    Input

    Line 1: Four space-separated integers: N, I, H and R
    Lines 2..R+1: Two distinct space-separated integers A and B (1 ≤ A, BN), indicating that cow A can see cow B.

    Output

    Lines 1..N: Line i contains the maximum possible height of cow i.

    Sample Input

    9 3 5 5
    1 3
    5 3
    4 3
    3 7
    9 8

    Sample Output

    5
    4
    5
    3
    4
    4
    5
    5
    5

    Source

     
    显然区间不会重叠,差分做就可以了。注意区间判重
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cstdlib>
     5 #include <algorithm>
     6 
     7 inline void read(int &x)
     8 {
     9     x = 0;char ch = getchar(),c = ch;
    10     while(ch < '0' || ch > '9')c = ch, ch = getchar();
    11     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
    12     if(c == '-')x = -x;
    13 }
    14 
    15 const int INF = 0x3f3f3f3f;
    16 const int MAXN = 10000 + 10;
    17 
    18 int n,rank,h,R,tmp;
    19 int data[MAXN], l[MAXN], r[MAXN], cnt[MAXN];
    20 
    21 bool cmp(int a, int b)
    22 {
    23     return l[a] == l[b] ? r[a] < r[b] : l[a] < l[b];
    24 }
    25 
    26 int main()
    27 {
    28     read(n),read(rank),read(h),read(R);
    29     for(register int i = 1;i <= R;++ i)
    30     {
    31         read(l[i]),read(r[i]);
    32         if(l[i] > r[i]) tmp = l[i], l[i] = r[i], r[i] = tmp;
    33         cnt[i] = i;
    34     }
    35     std::sort(cnt + 1, cnt + 1 + R, cmp);
    36     register int p, pp;
    37     for(register int i = 1;i <= R;++ i)
    38     {
    39         p = cnt[i];pp = cnt[i - 1];
    40         if(l[p] == l[pp] && r[p] == r[pp])continue;
    41         data[l[p] + 1] -= 1, data[r[p]] += 1;
    42     }
    43         
    44     for(register int i = 1;i <= n;++ i)
    45     {
    46         data[i] += data[i - 1];
    47         printf("%d
    ", data[i] + h);
    48     }
    49     return 0;
    50 }
    POJ3263 Tallest Cow
     
     
     
  • 相关阅读:
    vsftpd的主动模式与被动模式
    Linux环境下vsftpd参数配置
    CentOS下的网络配置文件说明
    第一篇博客,随笔留念
    asp.net xml 增删改操作
    asp.net json 与xml 的基础事例
    linq 之 Distinct的使用
    【P2015】二叉苹果树(树状DP)
    【P2016】战略游戏(贪心||树状DP)
    【P2774】方格取数问题(贪心+最大流,洛谷)
  • 原文地址:https://www.cnblogs.com/huibixiaoxing/p/7283208.html
Copyright © 2011-2022 走看看