JSure的代码库

Bus PassTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionYou travel a lot by bus and the costs of all the seperate tickets are starting

Free DIY TourTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionWeiwei is a software engineer of ShiningSoft. He has just excellently ful

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536K   DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix t

Fire StationTime Limit: 2 Seconds      Memory Limit: 65536 KBA city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest st

Easter HolidaysTime Limit: 1 Second      Memory Limit: 32768 KB      Special JudgeScandinavians often make vacation during the Easter holidays in the largest ski resort Are. Are provides fanta

WormholesTime Limit: 2000MS Memory Limit: 65536KDescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very pecu

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20025 Accepted: 7175DescriptionSeveral currency exchange points are working in our city.

ArbitrageTime Limit: 1000MS Memory Limit: 65536KDescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than

int inq[N], n, m, tot, hh[N], dis[N];struct node{    int u, v, w, next;} edge[2*M];void init(){    memset(hh, -1, sizeof(hh));    tot = 0;}void add(int u, int v, int w){   

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12731 Accepted: 5684DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently

Cave RaiderTime Limit: 1000MS Memory Limit: 10000KDescriptionAfkiyia is a big mountain. Inside the mountain, there are many caves. These caves are connected by tunnels. Hidde

Cliff ClimbingTime Limit: 10 Seconds      Memory Limit: 32768 KBAt 17:00, special agent Jack starts to escape from the enemy camp. There is a cliff in between the camp and the nearest safety

Invitation CardsTime Limit: 8000MS Memory Limit: 262144KDescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are

给出一个有向图，其中每个点向自己下面的和右边的那个点有边相连。'*'号的点可以进行瞬间转移（可以选择转移或者不转移），每个点有点权且不为负。'#'号的点是不能到达的点。每到一个点获得它的权值且仅一次，求出能获得的最大点权和。