其他

Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 27156 Accepted: 7156DescriptionYou may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your

題目連結：http://acm.hdu.edu.cn/showproblem.php?pid=4490Mad VeterinarianTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 279    Accepted Submission(s): 111Special JudgeProblem DescriptionMad

地址：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3018題意：在平面內最多又32768個點，現在有兩種操作，1：在一些點上加上一個數n，2：詢問一個矩形地區內的點的數的和分析：這題一看像線段樹，想離線搞，發現不好處理，也許可以，不過我是做不來了，後來自己YY了下二維的線段樹，從來沒寫過=

地址：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3016題意：給你n條線段，這些線段都平行於座標軸，沒有線段重疊，但是有交點，切割每條線段有一個值，現在這些線段形成一些封閉的區間，問怎樣切割使得所有點之間有通路，且花費最小分析：這題拋掉線段的外殼，很容易發現每個格子是一個點，外面的平面是一個點，點之間的邊正好是切割線段的花費，答案明顯的是最小產生樹的值。。。不過這些線段怎麼處理成小格子，頭疼=

轉自：http://blog.csdn.net/woshi250hua/article/details/7872081           1、強烈的事業心將來，他也一定會有自己熱愛的事業。而且，男人最性感的時刻之一，就是他專心致志做事的時候。所以，找一個機會在他全神貫注玩ACM的時候，從側面好好觀察他，你就會發現我說的話沒錯。　　　　2、永不放棄的精神在比賽剛開始，神牛隊就飄崎嶇。玩ACM的男生不會退縮，而是毅然決定一個人繼續AC下去，靠著自己對勝利的渴望，拿下一個氣球、兩個氣球、三個氣球……

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8096 Accepted Submission(s): 3063Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad

Travel in timeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 971 Accepted Submission(s): 196Problem Description　　Bob gets tired of playing games, leaves Alice, and travels to Changsha alone.

NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 3868 Accepted: 1321DescriptionA network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are

The Best Travel DesignTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1359 Accepted: 340DescriptionDou Nai is an excellent ACM programmer, and he felt so tired recently that he wants to release himself from the hard work. He plans a travel

The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33836 Accepted: 20105Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers

HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 529 Accepted Submission(s): 153Problem Description　　One day, a hunter named James went to a mysterious area to find the treasures. James

A Star not a Tree?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2519 Accepted: 1332DescriptionLuke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to

PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 48269 Accepted: 16570DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program

源地址http://blog.csdn.net/linleiqin/article/details/5637647收藏以後深入練習，近期恐怕是搞不定了。。。-----------------------------最佳化問題------------------------------------- ----------------------常規動態規劃  SOJ1162 I-Keyboard  SOJ2096 Maximum Submatrix  SOJ2111 littleken

charge-stationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 587 Accepted Submission(s): 291Problem DescriptionThere are n cities in M^3's empire. M^3 owns a palace and a car and the palace

 二分圖最大匹配除了匈牙利演算法還有一個Hopcroft-Karp演算法，匈牙利演算法的複雜的為O(ne)，而Hopcroft-Karp演算法的複雜度為O(en^0.5)。     該演算法的精髓在於同時找多條增廣路進行反轉。我們先用BFS找出可能的增廣路，這裡用到BFS層次搜尋的概念，記錄當前結點在第幾層，用於後面DFS沿增廣路反轉時用，然後再用DFS沿每條增廣路反轉。這樣不停地找，直至無法找到增廣路為止。     wiki上的說明: http://en.wikipedia.org/wiki/

To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6612 Accepted Submission(s): 3159Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is

給出一個國際棋盤的大小，判斷馬能否不重複的走過所有格，並記錄下其中按字典序排列的第一種路徑。注意字典序。#include<iostream>#include<cstdio>#include<cstring>using namespace std;int dx[8]= {-1,1,-2,2,-2,2,-1,1};//按字典順序走必須這麼寫int dy[8]= {-2,-2,-1,-1,1,1,2,2};int

1519. Formula 1Time Limit: 1.0 secondMemory Limit: 16 MBBackgroundRegardless of the fact, that Vologda could not get rights to hold the Winter Olympic games of 20**, it is well-known, that the city will conduct one of the Formula 1 events. Surely,

SudokuTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5830 Accepted: 1839DescriptionIn the game of Sudoku, you are given a large 9 × 9 grid divided into smaller 3 × 3 subgrids. For example,.2738..1..1...6735.......293.5692.8...........6.174