每个人的心中都藏着一个衰小孩儿

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 37564 Accepted: 15532DescriptionGiven two strings a and b we define a*b to be their concatena

I - 开心与不开心一一细数着你再不舍Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:65536KB   64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3187DescriptionFJ and his c

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23812 Accepted: 13982DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18703 Accepted: 7896DescriptionArbitrage is the use of discrepancies in currency exchange rates t

题目链接：http://poj.org/problem?id=1860分析：给定N种货币，某些货币之间可以相互兑换，现在给定一些兑换规则，问能否从某一种货币开始兑换，经过一些中间货币之后，最后兑换回这种货币，并且得到的钱比之前的多。可以把初始兑换的货币看成源点，采用bellman-ford进行求解，若可以实现要求，则说明图中存在可以无限增大的环，这个可以通过bellman-ford

poj题目链接：    http://poj.org/problem?id=1328分析：大致题意：将一条海岸线看成X轴，X轴上面是大海，海上有若干岛屿，给出雷达的覆盖半径和岛屿的位置，要求在海岸线上建雷达，在雷达能够覆盖全部岛屿情况下，求雷达的最少使用量。    本题一看就用贪心做，怎么贪呢？先研究一下每个岛屿，设岛屿到海岸线的垂直距离为d，雷达的覆盖半径为k，若d>k,直接输出

题目：http://poj.org/problem?id=1125分析：给你

poj1088:http://poj.org/problem?id=1088

Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12481 Accepted: 3584DescriptionWindy has N balls of distinct weights from 1 unit to N unit

题目链接：http://poj.org/problem?id=1083分析：一层楼上有400个房间，南边跟北边每边各200个，现在要在房间之间移动一些桌子，但是过道太窄了，每次只能通过一个，要求的是搬运一些桌子要花的最短时间，过道不冲突的话可以同时搬。代码：#include#include#define N 220void swap(int &a,int &b){

青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 100081 Accepted: 19194Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 36852 Accepted: 13502DescriptionWhile exploring his many farms, Farmer John has discovered a nu

Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3675 Accepted: 2446 Special JudgeDescriptionThe system of Martians' blood relations

TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8305 Accepted: 4004DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43132 Accepted: 17472DescriptionA subsequence of a given sequence is the given sequenc

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14154 Accepted: 7049DescriptionThe little cat is so famous, that many couples

SumsetsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10005 Accepted: 2737DescriptionGiven S, a set of integers, find the largest d such that a + b + c =