• <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 極限定律 閱讀(371) 評論(0)  編輯 收藏 引用 所屬分類: ACM/ICPC

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

            導航

            統計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            18岁日韩内射颜射午夜久久成人| 国产AⅤ精品一区二区三区久久| 久久夜色撩人精品国产| 久久久中文字幕日本| 久久综合成人网| 日产精品久久久久久久性色| 99精品久久精品一区二区| 久久免费精品一区二区| 一本一道久久a久久精品综合| 欧洲人妻丰满av无码久久不卡| 狠狠干狠狠久久| 久久久久久噜噜精品免费直播| 一本色道久久99一综合| 精品久久久久国产免费| 国产偷久久久精品专区| 精品国产乱码久久久久久浪潮| 亚洲精品国精品久久99热一| 亚洲乱亚洲乱淫久久| 亚洲午夜无码AV毛片久久| 久久中文字幕一区二区| 精品久久亚洲中文无码| 久久人人爽人人爽人人片AV麻豆| 精品无码久久久久久午夜| 伊人久久大香线蕉精品不卡 | 国内精品伊人久久久久| 色播久久人人爽人人爽人人片AV| 一本久久a久久精品综合夜夜 | 亚洲国产精品无码久久久不卡| 国产午夜福利精品久久| 97r久久精品国产99国产精| 午夜精品久久久久久影视riav| 国内精品久久久久国产盗摄| 精品蜜臀久久久久99网站| 亚洲国产另类久久久精品| 伊人热热久久原色播放www| 久久久久亚洲精品无码网址 | 7777精品久久久大香线蕉| 武侠古典久久婷婷狼人伊人| 久久久久久国产a免费观看不卡| 久久久久免费精品国产| 精品久久久久久国产91|