锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久妇女高潮几次MBA,一级女性全黄久久生活片免费,A级毛片无码久久精品免费http://www.shnenglu.com/cisjiong/category/13698.htmlAlways onlinezh-cnMon, 28 Jun 2010 07:56:03 GMTMon, 28 Jun 2010 07:56:03 GMT60FOJ1919 K-way Merging sort(java+dfs+map)http://www.shnenglu.com/cisjiong/archive/2010/06/04/117147.htmlCisJiongCisJiongThu, 03 Jun 2010 16:55:00 GMThttp://www.shnenglu.com/cisjiong/archive/2010/06/04/117147.htmlhttp://www.shnenglu.com/cisjiong/comments/117147.htmlhttp://www.shnenglu.com/cisjiong/archive/2010/06/04/117147.html#Feedback0http://www.shnenglu.com/cisjiong/comments/commentRss/117147.htmlhttp://www.shnenglu.com/cisjiong/services/trackbacks/117147.htmlhttp://acm.fzu.edu.cn/problem.php?pid=1919
澶ф剰灝辨槸姹傞鐩墍瀹氫箟鐨凨鍚堝茍鎺掑簭闇瑕佷氦鎹㈢殑嬈℃暟銆?br>璁板繂鍖栨悳绱?br>

1銆乶<k,瑕佺敤(n-1)*n/2姣旇緝
2銆乶≥k鏃訛紝n鍒嗘垚k鍫嗭紝鏈塶%k鍫嗙殑f(n/k+1,k)
3銆佹湁k-n%k鍫嗙殑f(n/k,k)錛?
4銆乲鍫嗗悎騫舵椂錛屾渶澶ф瘮杈冩鏁頒負錛氭瘡嬈″彇鏈灝忓奸兘鏄k鍫嗘瘮杈冨彇鏈灝忥紝鐢╧-1嬈★紝鎬葷殑涓?k-1)*(n-k+1)
5銆佹渶鍚庡墿涓媖-1鍫嗗惈涓涓厓绱犵殑鍫嗭紝鐢?k-1)*(k-2)/2嬈℃瘮杈冦?

java HashMap銆?br>鏂板緩HashMap錛歁ap<BigInteger,BigInteger> map=new HashMap<BigInteger,BigInteger>();
鎻掑叆閿鹼細map.put(n,tmp)
鏌ユ壘閿槸鍚﹀瓨鍦細map.containsKey(n)錛岃繑鍥瀊oolean鍨嬨?br>榪斿洖閿鹼細map.get(n)

Java Map鎺ュ彛鎵╁睍錛?br>http://www.javaeye.com/topic/421014



CisJiong 2010-06-04 00:55 鍙戣〃璇勮
]]>
FOJ1914 Funny Positive Sequencehttp://www.shnenglu.com/cisjiong/archive/2010/05/30/116725.htmlCisJiongCisJiongSun, 30 May 2010 02:13:00 GMThttp://www.shnenglu.com/cisjiong/archive/2010/05/30/116725.htmlhttp://www.shnenglu.com/cisjiong/comments/116725.htmlhttp://www.shnenglu.com/cisjiong/archive/2010/05/30/116725.html#Feedback0http://www.shnenglu.com/cisjiong/comments/commentRss/116725.htmlhttp://www.shnenglu.com/cisjiong/services/trackbacks/116725.htmlhttp://acm.fzu.edu.cn/problem.php?pid=1914
棰樼洰澶ф剰:
灝辨槸緇欏嚭涓涓簭鍒楋紝灝嗗畠寰幆宸︾Щn嬈″彲浠ュ緱鍒皀涓笉鍚岀殑搴忓垪錛?br>姹傝繖n涓簭鍒椾腑鑳藉鐢熸垚棰樼洰鎵瀹氫箟鐨勫簭鍒椾釜鏁般?br>
鍙互鍏堢畻鍑轟笉婊¤凍鏉′歡鐨勫簭鍒楋紝鐩稿噺鍗沖彲銆?br>涓嶆弧瓚崇殑搴忓垪鑲畾鏄洜涓虹敱闈炴鏁扮殑瀛樺湪錛屾墍浠ュ姣忎釜闈炴鏁幫紝鍚戝墠鎼滅儲騫剁瘡鍔犵洿鍒板拰澶т簬0錛?br>鍒欎互榪欎釜鍖洪棿鍐呮墍鏈夋暟寮濮嬬殑搴忓垪鍧囦笉婊¤凍鏉′歡銆?br>



CisJiong 2010-05-30 10:13 鍙戣〃璇勮
]]>
FOJ1084 Three powers(楂樼簿搴?http://www.shnenglu.com/cisjiong/archive/2010/05/11/115133.htmlCisJiongCisJiongTue, 11 May 2010 12:53:00 GMThttp://www.shnenglu.com/cisjiong/archive/2010/05/11/115133.htmlhttp://www.shnenglu.com/cisjiong/comments/115133.htmlhttp://www.shnenglu.com/cisjiong/archive/2010/05/11/115133.html#Feedback0http://www.shnenglu.com/cisjiong/comments/commentRss/115133.htmlhttp://www.shnenglu.com/cisjiong/services/trackbacks/115133.htmlhttp://acm.fzu.edu.cn/problem.php?pid=1084
a[n]>Sa[i](i<n), f[n]=f[n-1]*2鍓峮涓暟鍏辨湁2^n縐?鐒跺悗java鍗沖彲(NetBeans,璧?)
import java.util.*;
import java.math.BigInteger;
public class Main
{
    
public static void main(String[] args) 
    
{
        Scanner cin
=new Scanner(System.in);
        BigInteger num;
        
int[] res=new int[100];
        
int len;
        
while(cin.hasNextBigInteger())
        
{
            num
=cin.nextBigInteger();
            
if(num.signum()==0break;
            num
=num.subtract(BigInteger.valueOf(1));
            
if(num.signum()==0)
            
{
                System.out.println(
"{ }");
                
continue;
            }

            len
=0;
            
while(num.bitLength()>0)
            
{
                res[len
++]=num.bitLength();
                num
=num.clearBit(res[len-1]-1);
            }

            System.out.print(
"{");
            
for(int i=len-1;i>0;i--)
                 System.out.print(
" "+BigInteger.valueOf(3).pow(res[i]-1)+",");
            System.out.println(
" "+BigInteger.valueOf(3).pow(res[0]-1)+" }");
        }

    }

}


CisJiong 2010-05-11 20:53 鍙戣〃璇勮
]]>
FOJ1492 鍦伴渿棰勬祴http://www.shnenglu.com/cisjiong/archive/2010/05/09/114890.htmlCisJiongCisJiongSat, 08 May 2010 17:07:00 GMThttp://www.shnenglu.com/cisjiong/archive/2010/05/09/114890.htmlhttp://www.shnenglu.com/cisjiong/comments/114890.htmlhttp://www.shnenglu.com/cisjiong/archive/2010/05/09/114890.html#Feedback0http://www.shnenglu.com/cisjiong/comments/commentRss/114890.htmlhttp://www.shnenglu.com/cisjiong/services/trackbacks/114890.htmlhttp://acm.fzu.edu.cn/problem.php?pid=1492
TLE浜嗗緢澶氾紝浠ュ墠鍚戝埆浜鴻浜嗕唬鐮佺湅涓嶆噦錛屼粖鏅氶噸鍋氾紝涓嬈C銆備富瑕佹濇兂鏄褰曟帓搴忓悗鐩擱偦鐨勫厓绱犲茍鍙婃椂鏇存柊銆?/p>
#include<iostream>
#include
<cmath>
#include
<algorithm>
using namespace std;

struct Node
{
    
int pos,val;
    
bool operator<(const Node &a) const
    
{
        
return val<a.val;
    }

}
node[100001];
int pos[100001],alloc[100001][2];//pos 鍘熸潵鍏冪礌錛?-n)鍦ㄦ帓搴忓悗鐨勪綅緗紝alloc鎺掑簭鍚庣浉閭誨厓绱犲湪鍘熷簭鍒楃殑浣嶇疆

inline 
int min(int a,int b)
{
    
return a>? b : a;
}


int main()
{
    
int i,n,res,t1,t2;
    
while(scanf("%d",&n)!=EOF)
    
{
        
for(i=1;i<=n;i++)
        
{
            scanf(
"%d",&node[i].val);
            node[i].pos
=i;
        }

        sort(node
+1,node+n+1);
        node[
0].pos=0,node[0].val=100000000;
        node[n
+1].pos=n+1,node[n+1].val=100000000;
        pos[
0]=0,pos[n+1]=n+1;
        
for(i=1;i<=n;i++)
        
{
            pos[node[i].pos]
=i;
            alloc[node[i].pos][
0]=node[i-1].pos;
            alloc[node[i].pos][
1]=node[i+1].pos;
        }

        res
=node[pos[n]].val;
        
for(i=1;i<n;i++)
        
{
            t1
=abs(node[pos[i]].val-node[pos[alloc[i][0]]].val);
            t2
=abs(node[pos[i]].val-node[pos[alloc[i][1]]].val);
            res
+=min(t1,t2);
            alloc[alloc[i][
0]][1]=alloc[i][1];
            alloc[alloc[i][
1]][0]=alloc[i][0];
        }

        printf(
"%d\n",res);
    }

    
return 0;
}


CisJiong 2010-05-09 01:07 鍙戣〃璇勮
]]>
POJ1032 Parliament錛團OJ 1698銆丗OJ1823錛?/title><link>http://www.shnenglu.com/cisjiong/archive/2010/05/01/114146.html</link><dc:creator>CisJiong</dc:creator><author>CisJiong</author><pubDate>Sat, 01 May 2010 13:58:00 GMT</pubDate><guid>http://www.shnenglu.com/cisjiong/archive/2010/05/01/114146.html</guid><wfw:comment>http://www.shnenglu.com/cisjiong/comments/114146.html</wfw:comment><comments>http://www.shnenglu.com/cisjiong/archive/2010/05/01/114146.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/cisjiong/comments/commentRss/114146.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/cisjiong/services/trackbacks/114146.html</trackback:ping><description><![CDATA[     鎽樿: http://acm.pku.edu.cn/JudgeOnline/problem?id=1032緇欏嚭n錛屾妸n鍒嗚В涓鴻嫢騫蹭笉鐩稿悓鏁頒箣鍜岋紝浣夸箣涔樼Н鏈澶с傝椽蹇冿紝Discuss閲岄潰鐨勬濊礬錛氭妸n鍒嗚В涓轟粠2寮濮嬬殑榪炵畫鏁存暟錛屽鏋滄湁澶氾紝鍒欎粠楂樹綅寮濮嬩緷嬈″姞1銆傚26錛屾垜浠緱鍒?+3+4+5+6錛屾鏃惰繕鍓╀綑6錛?6-2-3-4-5-6錛夛紝鎺ヤ笅鏉ヤ粠楂樹綅渚濇鍔犱竴錛屽彉鎴?+4+5+6+7錛岃繕鍓?錛岀戶緇姞緇欐渶澶х殑7錛屾渶鍚庣瓟妗?..  <a href='http://www.shnenglu.com/cisjiong/archive/2010/05/01/114146.html'>闃呰鍏ㄦ枃</a><img src ="http://www.shnenglu.com/cisjiong/aggbug/114146.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/cisjiong/" target="_blank">CisJiong</a> 2010-05-01 21:58 <a href="http://www.shnenglu.com/cisjiong/archive/2010/05/01/114146.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <p>感谢您访问我们的网站,您可能还对以下资源感兴趣:</p> <a href="http://www.shnenglu.com/" title="精品视频久久久久">精品视频久久久久</a> <div class="friend-links"> </div> </div> </footer> <a href="http://www.0751seo.cn" target="_blank">久久精品免费一区二区三区</a>| <a href="http://www.ssc959.cn" target="_blank">日韩欧美亚洲综合久久影院Ds</a>| <a href="http://www.zg-ly.cn" target="_blank">久久久久国产精品人妻</a>| <a href="http://www.yousms.cn" target="_blank">99久久99久久精品国产片果冻</a>| <a href="http://www.837666.cn" target="_blank">欧美一区二区三区久久综合 </a>| <a href="http://www.t421.cn" target="_blank">久久久久久免费一区二区三区</a>| <a href="http://www.xiangxiangren.cn" target="_blank">亚洲国产成人久久精品动漫</a>| <a href="http://www.aijialicai.com.cn" target="_blank">久久精品国产72国产精福利</a>| <a href="http://www.jmjxmt.cn" target="_blank">亚洲AV无一区二区三区久久</a>| <a href="http://www.summernote.cn" target="_blank">999久久久国产精品</a>| <a href="http://www.ddvxo.cn" target="_blank">亚洲精品乱码久久久久久久久久久久 </a>| <a href="http://www.ehxs.cn" target="_blank">九九热久久免费视频</a>| <a href="http://www.biezhuai.cn" target="_blank">亚洲精品乱码久久久久久久久久久久 </a>| <a href="http://www.shhuguang.com.cn" target="_blank">一本大道加勒比久久综合</a>| <a href="http://www.thenorthface.net.cn" target="_blank">久久精品国产亚洲5555</a>| <a href="http://www.zhinvest.cn" target="_blank">久久夜色精品国产噜噜噜亚洲AV </a>| <a href="http://www.shhuguang.com.cn" target="_blank">亚洲精品WWW久久久久久</a>| <a href="http://www.zhaodongjie.cn" target="_blank">精品国产乱码久久久久久1区2区</a>| <a href="http://www.91share.com.cn" target="_blank">久久亚洲国产精品123区</a>| <a href="http://www.athj.cn" target="_blank">97久久精品国产精品青草</a>| <a href="http://www.jm1818.cn" target="_blank">一本一本久久a久久精品综合麻豆</a>| <a href="http://www.hjte.cn" target="_blank">久久er热视频在这里精品</a>| <a href="http://www.yjpute.cn" target="_blank">午夜精品久久久久久99热</a>| <a href="http://www.bestfanyi.cn" target="_blank">亚洲午夜精品久久久久久浪潮</a>| <a href="http://www.0r2kd.cn" target="_blank">91久久精品电影</a>| <a href="http://www.wzqcz.cn" target="_blank">青草影院天堂男人久久</a>| <a href="http://www.leaow.cn" target="_blank">久久天天躁狠狠躁夜夜躁2O2O</a>| <a href="http://www.8351840.cn" target="_blank">四虎久久影院</a>| <a href="http://www.gay2000.cn" target="_blank">亚洲美日韩Av中文字幕无码久久久妻妇</a>| <a href="http://www.gkxee.cn" target="_blank">久久青草国产精品一区</a>| <a href="http://www.girlsp.cn" target="_blank">99久久国产综合精品麻豆</a>| <a href="http://www.sjz114.net.cn" target="_blank">99久久国产精品免费一区二区</a>| <a href="http://www.gmyk.net.cn" target="_blank">国产免费久久精品99re丫y</a>| <a href="http://www.seajack.cn" target="_blank">久久亚洲高清综合</a>| <a href="http://www.lismi.cn" target="_blank">久久综合色之久久综合</a>| <a href="http://www.y447.cn" target="_blank">久久男人中文字幕资源站</a>| <a href="http://www.shebianfen.cn" target="_blank">久久国产精品波多野结衣AV</a>| <a href="http://www.or-z.cn" target="_blank">久久青青草原精品国产软件</a>| <a href="http://www.baaag.cn" target="_blank">亚洲成av人片不卡无码久久</a>| <a href="http://www.ptrjmfv.cn" target="_blank">亚洲国产成人久久综合一区77</a>| <a href="http://www.dntjj.cn" target="_blank">国产一区二区久久久</a>| <script> (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })(); </script> </body>