zoukankan      html  css  js  c++  java
  • BZOJ1635 [Usaco2007 Jan]Tallest Cow 最高的牛 数列差分

    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.

    有n(1 <= n <= 10000)头牛从1到n线性排列,每头牛的高度为h[i](1 <= i <= n),现在告诉你这里面的牛的最大高度为maxH,而且有r组关系,每组关系输入两个数字,假设为a和b,表示第a头牛能看到第b头牛,能看到的条件是 a, b之间的其它牛的高度都严格小于min(h[a], h[b]),而h[b] >= h[a]

    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, B <= N), 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


    INPUT DETAILS:

    There are 9 cows, and the 3rd is the tallest with height 5.

    Sample Output

    5
    4
    5
    3
    4
    4
    5
    5
    5

    HINT

    题解:

      今天用这题问什么是差分数列但是这目测并不算是一个知识点。。用差分数列优化一下到O(1)时间内查询就好了。。

    #include <iostream>
    #include <cstdio>
    #include <algorithm>
    #include <map>
    using namespace std;
    const int MAXN=10001;
    map<pair<int,int>,bool>f;  
    int h[MAXN];
    int main(int argc, char *argv[])
    {
        int n,maxi,maxh,r,i,j,x,y;
        int tot=0;
        scanf("%d%d%d%d",&n,&maxi,&maxh,&r);
        for(i=1;i<=r;i++)
        {
            scanf("%d%d",&x,&y);
            if(x==y) continue;
            if(x>y) swap(x,y);
            if(!f[make_pair(x,y)]) {
                f[make_pair(x,y)]=1;
                h[x+1]--;
                h[y]++;
            }
        }
        h[1]=maxh;
        for(i=1;i<=n;i++) {
            tot+=h[i];
            printf("%d
    ",tot);
        }
        return 0;
    }
  • 相关阅读:
    MOF编译器无法连接VMI服务器。原因可能是语义错误的解决方案
    【原】Sql Server 2008---安装时卸载Visual Studio
    SQL SERVER 删除前判断指定的表或者存储过程是否存在
    NPOI 表头、页眉页脚重复设置
    在vs2010中显示代码的行数
    【summary】JQuery 相关css、ajax、数据操作函数或方法
    CSS自适应的占位符效果
    NPOI 生成 excel基本设置
    JavaSE——转换流和缓冲流
    javaSE——字符流
  • 原文地址:https://www.cnblogs.com/BeyondW/p/5774791.html
Copyright © 2011-2022 走看看