小周的专栏

The Dole Queue In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applican

Design the cityTime Limit: 1 Second      Memory Limit: 32768 KB Cerror is the mayor of city HangZhou. As you may know, the traffic system of this city is so terrible, that there are traffi

Problem B: Throwing cards away I 对于此题，我只能说很无奈，就是因为输入1的时候没有控制好，所以答案一直是错误的！Given is an ordered deck ofn cards numbered 1 tonwith card 1 at the top and card n at the bottom.The following operat

从后面到前面，把破坏桥看成建立桥，之后连通的集合反序输出就可以了#include #include#include#include#include#define maxn 100010int n,m;int fa[maxn],v[maxn],u[maxn],res[maxn];int find(int x){ return fa[x]==x?x:(fa[x]=fi

Just a HookTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16052    Accepted Submission(s): 7984Problem DescriptionIn the game of Do

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 12459 Accepted: 6159DescriptionRailway tickets were difficult to buy around the Lunar New Y

#include#include#include#include#include#include#include#include#include#include#include#define Inf (1<<30)#define LL long long#define MOD 1000000009#pragma comment(linker, "/STACK:10240

Team Queue Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday

#include#include#include#include#include#include#include#include#include#include#include#define Inf (1<<30)#define LL long long#define MOD 1000000009#pragma comment(linker, "/STACK:10240

2007/2008 ACM International Collegiate Programming Contest University of Ulm Local ContestProblem E: ExpressionsArithmetic expressions are usually written with the operators in between the t

#include#include#include#include#include#include#include#include#include#include#include#define Inf (1<<30)#define LL long long#define MOD 1000000009#pragma comment(linker, "/STACK:10240

Tree You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of

Problem B - Generalized Matrioshkas Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be ope

#include#include#include#include#include#include#include#include#include#include#include#define Inf (1<<30)#define LL long long#define MOD 20071027#pragma comment(linker, "/STACK:1024000

#include#include#include#include#define M 32001using namespace std;int res[M],d[M+1];int lowbit(int x){ return x&(-x);//巧妙二进制}void update(int x){ while(x<=M) { d[x]+=1; x+=lowbit(x);

时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi和小Ho是一对好朋友，出生在信息化社会的他们对编程产生了莫大的兴趣，他们约定好互相帮助，在编程的学习道路上一同前进。这一天，他们遇到了一本词典，于是小Hi就向小Ho提出了那个经典的问题：“小Ho，你能不能对于每一个我给出的字符串，都在这个词典里面找到以这个字符串开头的所有单词呢？”

Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which mul

How far away ？Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5082    Accepted Submission(s): 1921Problem DescriptionThere are n hou