• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            POJ 3264 RMQ問題

            Description

            For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the milking lineup to play the game. However, for all the cows to have fun they should not differ too much in height.

            Farmer John has made a list of Q (1 ≤ Q ≤ 200,000) potential groups of cows and their heights (1 ≤ height ≤ 1,000,000). For each group, he wants your help to determine the difference in height between the shortest and the tallest cow in the group.

            Input

            Line 1: Two space-separated integers, N and Q.
            Lines 2..N+1: Line i+1 contains a single integer that is the height of cow i
            Lines N+2..N+Q+1: Two integers A and B (1 ≤ ABN), representing the range of cows from A to B inclusive.

            Output

            Lines 1..Q: Each line contains a single integer that is a response to a reply and indicates the difference in height between the tallest and shortest cow in the range.

            Sample Input

            6 3
            1
            7
            3
            4
            2
            5
            1 5
            4 6
            2 2

            Sample Output

            6
            3
            0

            Source

                題目大意:有N頭牛,對于第i頭牛,它的高度是h[i];有Q個查詢,每次查詢給定一個區間[a,b],求第a頭牛到第b頭牛中最高的和最矮的相差多少。對于這種典型的RMQ問題,可以建立一棵線段樹,然后查詢。
            #include <iostream>

            #define max(a,b) (a>b?a:b)
            #define min(a,b) (a<b?a:b)
            const int MAXN = 50001;

            struct segment{
                
            int left,right;
                
            int high,low;
            }
            tree[MAXN*2];
            int t,s,height[MAXN];

            void create(int l,int r,int index){
                tree[index].left
            =l,tree[index].right=r;
                
            if(l==r){
                    tree[index].high
            =height[l];
                    tree[index].low
            =height[l];
                    
            return;
                }

                
            int mid=(l+r)>>1;
                create(l,mid,
            2*index);
                create(mid
            +1,r,2*index+1);
                tree[index].high
            =max(tree[2*index].high,tree[2*index+1].high);
                tree[index].low
            =min(tree[2*index].low,tree[2*index+1].low);
            }

            void update(int l,int r,int index){
                
            if(tree[index].left==&& tree[index].right==r){
                    
            if(tree[index].high>t) t=tree[index].high;
                    
            if(tree[index].low<s) s=tree[index].low;
                    
            return;
                }

                
            int mid=(tree[index].left+tree[index].right)>>1;
                
            if(r<=mid)
                    update(l,r,
            2*index);
                
            else if(l>mid)
                    update(l,r,
            2*index+1);
                
            else{
                    update(l,mid,
            2*index);
                    update(mid
            +1,r,2*index+1);
                }

            }

            int main(){
                
            int i,n,q,x,y;
                scanf(
            "%d %d",&n,&q);
                
            for(i=1;i<=n;i++) scanf("%d",&height[i]);
                create(
            1,n,1);
                
            for(i=1;i<=q;i++){
                    scanf(
            "%d %d",&x,&y);
                    t
            =0,s=10000000;
                    update(x,y,
            1);
                    printf(
            "%d\n",t-s);
                }

                
            return 0;
            }

            posted on 2009-05-14 16:05 極限定律 閱讀(372) 評論(0)  編輯 收藏 引用 所屬分類: ACM/ICPC

            <2009年5月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            導航

            統計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            亚洲国产精品嫩草影院久久| 人妻久久久一区二区三区| 久久精品草草草| 久久美女网站免费| 欧美精品一区二区久久| 久久成人国产精品| 久久精品无码一区二区三区免费| 亚洲国产成人精品女人久久久| 亚洲av伊人久久综合密臀性色| 99久久婷婷国产一区二区| 欧美精品福利视频一区二区三区久久久精品 | 久久综合久久美利坚合众国| 伊人久久大香线蕉精品| 亚洲美日韩Av中文字幕无码久久久妻妇 | 模特私拍国产精品久久| 无码国内精品久久人妻| 99久久婷婷国产综合精品草原| 日日狠狠久久偷偷色综合96蜜桃| 久久水蜜桃亚洲av无码精品麻豆| 久久九九久精品国产免费直播| 久久婷婷五月综合97色一本一本| 久久国产免费| 麻豆精品久久久一区二区| 亚洲国产精品久久电影欧美| 久久亚洲精品无码播放| 国产农村妇女毛片精品久久| 韩国三级大全久久网站| 777米奇久久最新地址| 色欲综合久久躁天天躁蜜桃| 精品无码久久久久国产动漫3d| 精品无码人妻久久久久久| 久久久久免费精品国产| 国产精品毛片久久久久久久| 国产情侣久久久久aⅴ免费| 亚洲中文字幕久久精品无码APP| 亚洲精品高清一二区久久| 四虎影视久久久免费| 亚洲国产日韩综合久久精品| 久久久国产视频| 亚洲va中文字幕无码久久| 久久精品www人人爽人人|