• <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>

            ACM___________________________

            ______________白白の屋
            posts - 182, comments - 102, trackbacks - 0, articles - 0
            <2010年10月>
            262728293012
            3456789
            10111213141516
            17181920212223
            24252627282930
            31123456

            常用鏈接

            留言簿(24)

            隨筆分類(332)

            隨筆檔案(182)

            FRIENDS

            搜索

            積分與排名

            最新隨筆

            最新評論

            閱讀排行榜

            評論排行榜

            MiYu原創, 轉帖請注明 : 轉載自 ______________白白の屋    

            題目地址 :

            http://acm.hdu.edu.cn/showproblem.php?pid=3016

            題目描述:

            Man Down

            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
            Total Submission(s): 618    Accepted Submission(s): 197


            Problem Description
            The Game “Man Down 100 floors” is an famous and interesting game.You can enjoy the game from 
            http://hi.baidu.com/abcdxyzk/blog/item/16398781b4f2a5d1bd3e1eed.html

            We take a simplified version of this game. We have only two kinds of planks. One kind of the planks contains food and the other one contains nails. And if the man falls on the plank which contains food his energy will increase but if he falls on the plank which contains nails his energy will decrease. The man can only fall down vertically .We assume that the energy he can increase is unlimited and no borders exist on the left and the right.

            First the man has total energy 100 and stands on the topmost plank of all. Then he can choose to go left or right to fall down. If he falls down from the position (Xi,Yi),he will fall onto the nearest plank which satisfies (xl <= xi <= xr)(xl is the leftmost position of the plank and xr is the rightmost).If no planks satisfies that, the man will fall onto the floor and he finishes his mission. But if the man’s energy is below or equal to 0 , he will die and the game is Over.

            Now give you the height and position of all planks. And ask you whether the man can falls onto the floor successfully. If he can, try to calculate the maximum energy he can own when he is on the floor.(Assuming that the floor is infinite and its height is 0,and all the planks are located at different height).
             

            Input
            There are multiple test cases.

            For each test case, The first line contains one integer N (2 <= N <= 100,000) representing the number of planks.

            Then following N lines representing N planks, each line contain 4 integers (h,xl,xr,value)(h > 0, 0 < xl < xr < 100,000, -1000 <= value <= 1000), h represents the plank’s height, xl is the leftmost position of the plank and xr is the rightmost position. Value represents the energy the man will increase by( if value > 0) or decrease by( if value < 0) when he falls onto this plank.
             

            Output
            If the man can falls onto the floor successfully just output the maximum energy he can own when he is on the floor. But if the man can not fall down onto the floor anyway ,just output “-1”(not including the quote)
             

            Sample Input
            4 10 5 10 10 5 3 6 -100 4 7 11 20 2 2 1000 10
             

            Sample Output
            140
             

             /*

              題目描述:  

                      不同高度處有不同的水平板,跳到該板會有血量變化v,

                      問當一個人從最高板開始,可以向左或者向右,

                      豎直跳到下面的板,求下落到地面的最大血量,或者-1。

                      線段樹+dp  

                      需要用線段樹查詢得到每個板的兩個端點下落后會到哪個板;

                      然后根據這個從最高的開始dp就可以了

                      dp[i] = max ( dp[i], dp[i^].v )  // dp[i^] 代表能走到 i 的線段 

            /* 


            /*

            Mail to   : miyubai@gamil.com

            Link      : http://www.cnblogs.com/MiYu  || http://www.shnenglu.com/MiYu

            Author By : MiYu

            Test      : 1

            Complier  : g++ mingw32-3.4.2

            Program   : HDU_3016

            Doc Name  : Man Down

            */

            //#pragma warning( disable:4789 )

            #include <iostream>

            #include <fstream>

            #include <sstream>

            #include <algorithm>

            #include <string>

            #include <set>

            #include <map>

            #include <utility>

            #include <queue>

            #include <stack>

            #include <list>

            #include <vector>

            #include <cstdio>

            #include <cstdlib>

            #include <cstring>

            #include <cmath>

            #include <ctime>

            using namespace std;

            struct seg_tree {

                int id, left, right;

                int mid () { return ( left + right )>>1; }  

            }seg[333333];

            inline void creat ( int x, int y, int rt = 1 ) {

                 seg[rt].left = x;

                 seg[rt].right = y;

                 //0 代表地面 其他的自然數代表各層的木板編號  -1 代表有多條線段覆蓋 

                 seg[rt].id = 0;                  

                 if ( x == y ) return ;

                 int mid = seg[rt].mid();

                 creat ( x, mid, rt << 1 );

                 creat ( mid + 1, y, rt << 1 | 1 );     

            }

            inline void modify ( int x, int y, int id, int rt = 1 ) {

                 //找到了線段, 直接修改ID 覆蓋掉 

                 if ( seg[rt].left == x && seg[rt].right == y ) {

                     seg[rt].id = id;

                     return;   

                 }

                 int LL = rt << 1, RR = rt << 1 | 1, mid = seg[rt].mid();

                 // 前面沒有return掉, 那么這條線段肯定是被覆蓋的, 將它的標記下傳后標記為-1 

                 if ( seg[rt].id != -1 ) {      

                     seg[LL].id = seg[RR].id = seg[rt].id;          

                     seg[rt].id = -1;

                 }      

                 if ( y <= mid ) modify ( x, y, id, LL ); //分段修改 

                 else if ( x > mid ) modify ( x, y, id, RR );

                 else {

                      modify ( x, mid, id, LL );

                      modify ( mid + 1, y, id, RR );     

                 }

            }

            inline int query ( int pos, int rt = 1 ) {   // 查詢 Pos 所在線段的 id  

                if ( seg[rt].id != -1 ) return seg[rt].id; //線段被覆蓋 直接返回 ID 

                int LL = rt << 1, RR = rt << 1 | 1, mid = seg[rt].mid();

                if ( pos <= mid ) return query ( pos, LL );             //分段查詢 

                else return query ( pos, RR );    

            }

            inline bool scan_d(int &num)  //整數輸入

            {

                    char in;bool IsN=false;

                    in=getchar();

                    if(in==EOF) return false;

                    while(in!='-'&&(in<'0'||in>'9')) in=getchar();

                    if(in=='-'){ IsN=true;num=0;}

                    else num=in-'0';

                    while(in=getchar(),in>='0'&&in<='9'){

                            num*=10,num+=in-'0';

                    }

                    if(IsN) num=-num;

                    return true;

            }

            struct Plank {

                   int x,y,h,v,left,right; 

                   //按高排序       

                   friend bool operator < ( const Plank &a, const Plank &b ) {

                          return a.h < b.h;

                   }

            }pk[100010];

            int dp[100010];

            int main ()

            {

                int N, M;

                creat ( 1, 100000 );

                while ( scan_d ( N ) ) {

                       M = -1;

                       for ( int i = 1; i <= N; ++ i ) {

                            scan_d ( pk[i].h );scan_d ( pk[i].x );scan_d ( pk[i].y );scan_d ( pk[i].v );

                            if ( pk[i].y > M ) M = pk[i].y;       // 記錄 區間最大值, 加速用的 

                       }

                       modify  ( 1, M, 0 );

                       sort ( pk + 1, pk + N + 1 );               // 按高排序 

                       memset ( dp, 0, sizeof ( dp ) );

                       dp[N] = 100 + pk[N].v;

                       // 自底向上 更新 線段, 記錄 每條線段 左右端點能到達的 線段 ID 

                       for ( int i = 1; i <= N; ++ i ) {          

                            int x = pk[i].left = query ( pk[i].x );

                            int y = pk[i].right = query ( pk[i].y );

                            modify ( pk[i].x, pk[i].y, i );

                       }

                       int res = -1;

                       //自頂向下 DP    dp[i] = max ( dp[i], dp[i^].v )  

                       // dp[i^] 代表能走到 i 的線段 

                       for ( int i = N; i >= 1; -- i ) {   

                           if ( dp[ pk[i].left ] < dp[i] + pk[ pk[i].left ].v )

                                dp[ pk[i].left ] = dp[i] + pk[ pk[i].left ].v;

                           if ( dp[ pk[i].right ] < dp[i] + pk[ pk[i].right ].v )

                                dp[ pk[i].right ] = dp[i] + pk[ pk[i].right ].v; 

                       } 

                       printf ( "%d\n",dp[0] > 0 ? dp[0] : -1 );

                }

                return 0;

            }


             

             

            Feedback

            # re: HDU 3016 HDOJ 3016 Memory Control ACM 3016 IN HDU  回復  更多評論   

            2010-10-18 19:21 by の屋
            Google前n個搜索結果都和你的相關

            # re: HDU 3016 HDOJ 3016 Man Down ACM 3016 IN HDU  回復  更多評論   

            2010-10-30 07:51 by MiYu
            表明哥 有 成 牛 的資質 =. = 嘿嘿

            # re: HDU 3016 HDOJ 3016 Man Down ACM 3016 IN HDU  回復  更多評論   

            2013-07-13 21:50 by fegnchen
            pascal 版的有嗎??
            欧美黑人激情性久久| 久久免费精品视频| 婷婷久久精品国产| 久久精品国产色蜜蜜麻豆| 国内精品九九久久精品| 久久99国产亚洲高清观看首页| 国产ww久久久久久久久久| 97视频久久久| 成人精品一区二区久久久| 中文国产成人精品久久不卡| 亚洲国产精品婷婷久久| 色欲av伊人久久大香线蕉影院| 99久久国产综合精品成人影院| 久久精品国产亚洲AV影院| 91久久国产视频| 久久精品国产亚洲AV嫖农村妇女 | 久久久久国产成人精品亚洲午夜| 97香蕉久久夜色精品国产| 精品综合久久久久久88小说| 久久午夜伦鲁片免费无码| 一本色道久久综合| 99久久久精品| 久久久九九有精品国产| 色妞色综合久久夜夜| 三级韩国一区久久二区综合| 97久久精品人人做人人爽| 丁香五月网久久综合| 亚洲日本va中文字幕久久| 日本精品久久久久久久久免费| 精品一久久香蕉国产线看播放| 久久精品国产精品国产精品污| 久久精品国产清高在天天线| 国色天香久久久久久久小说| 偷窥少妇久久久久久久久| 国产69精品久久久久观看软件| 久久综合成人网| 久久婷婷是五月综合色狠狠| 亚洲国产精品无码久久青草| 久久久久久毛片免费播放| 人妻无码中文久久久久专区| 久久99国产综合精品免费|