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

            [USACO 09NOV] silver xoinc [dp]

            Posted on 2009-11-12 00:20 rikisand 閱讀(510) 評論(0)  編輯 收藏 引用 所屬分類: AlgorithmUSACO

            周六第一次做usaco玩,bronze的輕松切掉,然后申請promote,下午批準,話說rob 效率好高啊~ 于是繼續做silver 就遇到這個題- -!糾結了半天放棄····知道是dp 也考慮了方法就是 理不清楚;不知道是不是一天沒吃飯的緣故·····

            今天題解出來了~ 先看了大概思路 然后自己寫出來了~

            題目:

            Farmer John's cows like to play coin games so FJ has invented with
            a new two-player coin game called Xoinc for them.
            
            Initially a stack of N (5 <= N <= 2,000) coins sits on the ground;
            coin i from the top has integer value C_i (1 <= C_i <= 100,000).
            The first player starts the game by taking the top one or two coins
            (C_1 and maybe C_2) from the stack. If the first player takes just
            the top coin, the second player may take the following one or two
            coins in the next turn. If the first player takes two coins then
            the second player may take the top one, two, three or four coins
            from the stack. In each turn, the current player must take at least
            one coin and at most two times the amount of coins last taken by
            the opposing player. The game is over when there are no more coins
            to take.
            
            Afterwards, they can use the value of the coins they have taken
            from the stack to buy treats from FJ, so naturally, their purpose
            in the game is to maximize the total value of the coins they take.
            Assuming the second player plays optimally to maximize his own
            winnings, what is the highest total value that the first player can
            have when the game is over?
            
            MEMORY LIMIT: 20 MB
            
            PROBLEM NAME: xoinc
            
            INPUT FORMAT:
            
            * Line 1: A single integer: N
            
            * Lines 2..N+1: Line i+1 contains a single integer: C_i
            
            SAMPLE INPUT (file xoinc.in):
            
            5
            1
            3
            1
            7
            2
            簡單來說就是兩個人輪流取coins,每個人每次取得個數為1- 2*n;n為上一輪對方取得數目,
            求兩個人都是用最佳策略,先取得那個家伙最多能拿到多少硬幣。貌似可以算是簡單博弈論的思想
            思路:
                    coins[1···N] 從下到上 sum[1···N] 剩下 i個的和
                    找到無后效性的子問題。考慮在還剩下p個錢幣時候的情況,此時可以拿k個錢
            由于條件,k的大小受上一輪拿的個數i的限制 ,所以我們要加上一個變量i。得到
            dp[p][i]這個子問題。那么容易得到
            dp[p][i]=max(1=<k<=i*2){SuM(p to p-k+1)+SuM(p-k to 1)-dp[p-k][k]}
                        =max(1=<k<=i*2){sum[p]-dp[p-k][k]}
            按照這個可以得到一個O(N^3)的算法

            oidsolve(){
              
            for(inti=1;i<=N;i++)
            //剩下i個
                   
            for(intj=1;j<=N;j++)
            //上一人拿了j 個
                       
            for(intk=1;k<=j*2&&i-k>=0
            ;k++){
                            dp[i][j]=max(dp[i][j],sum[
            1]-sum[i+1
            ]-dp[i-k][k]);
                        }
                ret=dp[N][
            1
            ];
            }

             三重遞歸 ,最多可以過500的數據量  觀察可以得出 dp[p][j] 和 dp[p][j+1] 的計算有很多的重疊
            因為 上次拿了j+1 則可以比 dp[p][j] 多拿 2 個 

            然后,由于考慮j的范圍 應該為 N-i+1

            這樣得到了最終代碼:

            scanf("%d",&N);
            for(int i=1;i<=N;i++)    scanf("%d",coins+i);//{fin>>coins[i]; }
            sum[0]=0;
            for(int i=1;i<=N;i++)     sum[i]=sum[i-1]+coins[N-i+1]; 
            for(int i=1;i<=N;i++)        //剩下i個
            for(int j=1;j<= N-i +1;j++){ // 上次拿了j個
            if(dp[i][j]<dp[i][j-1])dp[i][j]=dp[i][j-1];
            if(2*j-1<=i&&dp[i][j]<sum[i]-dp[i-2*j+1][2*j-1]) dp[i][j]=sum[i]-dp[i-2*j+1][2*j-1];
            if(2*j<=i&&dp[i][j]<sum[i]-dp[i-2*j][2*j]) dp[i][j]= sum[i]-dp[i-2*j][2*j];
            }
            printf("%d\n",dp[N][1]);

            很晚了 ,先寫這么多 ,有空把bronze的寫了

            3個月后注:事實證明,當時么有時間 ~以后更沒有時間 ~~~ hoho`````````~~~~~~~``````````

            91久久精品国产成人久久| 精品一二三区久久aaa片| 亚洲国产成人久久精品动漫| 精品综合久久久久久88小说| 人人狠狠综合久久亚洲| 久久久久亚洲av无码专区导航| 国产V亚洲V天堂无码久久久| 久久国产精品偷99| 久久夜色精品国产噜噜亚洲AV| 久久久久一区二区三区| 久久无码专区国产精品发布| 99久久无色码中文字幕| 亚洲欧美日韩精品久久亚洲区| 久久国产精品成人影院| 亚洲成av人片不卡无码久久| 国产精品久久久久久福利漫画 | 亚洲精品97久久中文字幕无码| 无码久久精品国产亚洲Av影片 | 人妻精品久久无码专区精东影业| 国内精品久久久久久不卡影院 | 亚洲中文字幕久久精品无码喷水| 99热成人精品免费久久| 漂亮人妻被黑人久久精品| 久久久亚洲AV波多野结衣| 久久九九久精品国产| 久久综合九色综合久99| 久久超碰97人人做人人爱| 精产国品久久一二三产区区别| 久久精品亚洲福利| 久久精品亚洲男人的天堂| 国产91久久精品一区二区| 亚洲精品乱码久久久久久蜜桃图片| 午夜视频久久久久一区 | 久久精品嫩草影院| 久久99国产综合精品免费| 亚洲精品无码成人片久久| 日本欧美久久久久免费播放网| 亚洲中文久久精品无码ww16| 午夜精品久久久久久99热| 日韩乱码人妻无码中文字幕久久| 人妻精品久久无码专区精东影业|