POJ2774 Long Long Message

Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 29589 Accepted: 12018Case Time Limit: 1
15次阅读

POJ2185 Milking Grid

Milking GridTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8248 Accepted: 3557DescriptionEvery morning when t
8次阅读

POJ2594 Treasure Exploration[DAG的最小可相交路径覆盖]

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8301 Accepted: 3402DescriptionHave you eve
13次阅读

POJ1149 PIGS

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20759 Accepted: 9488DescriptionMirko works on a pig farm t
7次阅读

POJ2195 Going Home

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22254 Accepted: 11236DescriptionOn a grid map there
7次阅读

POJ3436 ACM Computer Factory

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7426 Accepted: 2654 Special JudgeDesc
13次阅读

SPOJ375 QTREE - Query on a tree

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。  本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权! DescriptionY
11次阅读

SPOJ1825 FTOUR2 - Free tour II

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。  本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权! DescriptionA
13次阅读

SPOJ - GSS1&&GSS3

  GSS1#include<cstdio>#include<iostream>#define lc k<<1#define rc k<<1|1using namespace std;const int M=1e5+5,N=M<
8次阅读

[BZOJ2588][Spoj 10628]Count on a tree

[BZOJ2588][Spoj 10628]Count on a tree试题描述给定一棵N个节点的树,每个点有一个权值,对于M个询问(u,v,k),你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案,初始为0,即第一个询问的u是明文。 
11次阅读