其他

鏈表：http://acm.hdu.edu.cn/showproblem.php?pid=1075題目:What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 7939    Accepted Submission(s): 2470Problem DescriptionIgnatius

連結:http://acm.hdu.edu.cn/showproblem.php?pid=1546題目：Idiomatic Phrases GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 969    Accepted Submission(s): 300Problem DescriptionTom is playing a

連結：http://acm.hdu.edu.cn/showproblem.php?pid=1247題目大意：按照字典序給出多個單詞，  可以發現裡面有些單詞是由字典中其它的兩個單片語成的。按順序輸出所有符合這個條件的單詞。分析與總結：用字典樹存下所有的單詞，然後對所有單詞一一枚舉， 對每個單詞， 又進行“拆分”，

連結:http://acm.hdu.edu.cn/showproblem.php?pid=2923題目：EinbahnstrasseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1117    Accepted Submission(s): 316Problem DescriptionEinbahnstra  e (German

連結：http://acm.hdu.edu.cn/showproblem.php?pid=1251 題目Problem

連結:http://acm.hdu.edu.cn/showproblem.php?pid=3339題目：Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.Nowadays,the crazy boy in

本文出自   http://blog.csdn.net/shuangde800題目連結：點擊開啟連結poj沒有題目描述，題目的pdf連結題意n個城市節點構成的一棵樹，節點i到節點j的電量損耗為 I*I*R*(i到j的路徑所含邊數)，現在要在某個結點上修建一個供電站，使得這個結點到所有其它節點的總損耗量最小。思路典型的樹形dp可以先用一次dfs求出每一點的子樹結點個數num[u]，以及每一點到它子樹所有結點的總距離f[u][0];然後再用一次dfs，推出每個結點到除去它子樹部分的結點總距離f[u]

連結：http://acm.hdu.edu.cn/showproblem.php?pid=2121題目：Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1610    Accepted Submission(s): 354Problem DescriptionAfter awarded lands

連結: http://acm.hdu.edu.cn/showproblem.php?pid=2807題目：The Shortest PathTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1421    Accepted Submission(s): 436Problem DescriptionThere are N cities in

連結:http://acm.hdu.edu.cn/showproblem.php?pid=4009題目：Transfer waterTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2508    Accepted Submission(s): 934Problem DescriptionXiaoA lives in a village.

連結：http://acm.hdu.edu.cn/showproblem.php?pid=1595題目：find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 667    Accepted Submission(s): 220Problem DescriptionMarica

連結:http://acm.hdu.edu.cn/showproblem.php?pid=1217題目：ArbitrageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2594    Accepted Submission(s): 1167Problem DescriptionArbitrage is the use of

連結：http://acm.hdu.edu.cn/showproblem.php?pid=1298題目：Problem DescriptionA while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more

演算法博大精深，我什麼時候才能自己想出這種好辦法呢？？？！！！#include<cstdio>#include<iostream>#include<cstring>using namespace std;int num[500001];int main(){ //freopen("in.txt","r",stdin); int n,a,b; while(scanf("%d",&n)!=EOF&&n) {

本文出自   http://blog.csdn.net/shuangde800認識觀察者模式我們先看看報紙和雜誌的訂閱是怎麼回事：1、報社出版報紙2、你向某家報社訂閱報紙，只要他們有新報紙出版，機會給你送來。只要你是他們的訂戶，你就會一直收到報紙3、當你不想再看報紙時，可以取消訂閱，他們就不會再送新報紙來。4、只要報社還在運營，就會一直有人向他們訂閱報紙或者取消報紙。出版者

連結：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3261題目：Connections in Galaxy WarTime Limit: 3 Seconds      Memory Limit: 32768 KBIn order to strengthen the defense ability, many stars in galaxy allied together and built many

本文出自   http://blog.csdn.net/shuangde800走進命令模式在餐廳的情境中，我們看看餐廳是怎樣工作的：1、顧客走進餐廳，點好菜後，產生訂單交給女服務員。2、女服務員把訂單拿到廚房工作室，大喊一聲：“訂單來了！”3、廚師訂單準備餐點。上面情境各角色職責:1、訂單封裝了顧客的請求。 和一般的對象一樣，訂單可以被傳遞，訂單內包含一個方法 orderUp(),

連結：http://acm.hdu.edu.cn/showproblem.php?pid=2846題目：RepositoryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1657    Accepted Submission(s): 605Problem DescriptionWhen you go shopping, you can

連結：http://poj.org/problem?id=3164題目：Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 8922 Accepted: 2609DescriptionAfter a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s

連結：http://acm.hdu.edu.cn/showproblem.php?pid=1535題目：Invitation CardsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1044    Accepted Submission(s): 459Problem DescriptionIn the age of