u013268685的专栏(有一种幸福叫AC，有一种期待叫AK)

主页讨论版问题名次状态统计请参赛队员将NickName修改为以下格式：队员1_队员2_队员3问题 F: Sort It时间限制: 6 Sec  内存限制: 128 MB提交: 30  解决: 8[提交][状态][讨论版]题目描述You are given a permutation of length n:p1,p2,

#1080 : 更为复杂的买卖房屋姿势时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi和小Ho都是游戏迷，“模拟都市”是他们非常喜欢的一个游戏，在这个游戏里面他们可以化身上帝模式，买卖房产。在这个游戏里，会不断的发生如下两种事件：一种是房屋自发的涨价或者降价，而另一种是政府有关部门针对房价的硬性调控。房价的

GTime Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3333DescriptionAfter inventing Turing Tree, 3xian always felt boring when

A - D-queryTime Limit:1500MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice SPOJ DQUERYAppoint description: System Crawler  (2014-12-06)Description

原创作品转载请注明出处欢迎抄袭，造福各位伸手党/************************************************************************* > File Name: evaluator.cpp > Author: acvcla > version 1.01 > QQ:acvcla@gmail.com

1117: Ready to declare时间限制: 1 Sec  内存限制: 128 MB提交: 358  解决: 41[提交][状态][讨论版]题目描述Finally, you find the most good-looking girl...You are going to write a letter to her. But you are not

- Permutation TransformerTime Limit:2000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status Practice UVA 11922Appoint description: System Crawler  (2014-11-30)De

D - Robotic SortTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1890Appoint description: System Crawler  (2014-11-27)Descri

Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14789 Accepted: 3915DescriptionIn order to make their sons brave, Jiaji

G - SuperMemoTime Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3580Appoint description: System Crawler  (2014-11-27)Descripti

B - LightsTime Limit:8000MS     Memory Limit:131072KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionNow you have N lights in a line. Don't worry - the lights don't have co

F - Play with ChainTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYaoYao is fond of playing his chains. He has a chain containi

给你一颗真二叉树（节点要么没有孩子，要么有两个孩子）的前序和后序遍历输出中序遍历序列。/************************************************************************* > File Name: Euler.cpp > Author: acvcla > QQ: > Mail: acvcl

题目1 : 最近公共祖先·二时间限制:10000ms单点时限:1000ms内存限制:256MB描述上上回说到，小Hi和小Ho用非常拙劣——或者说粗糙的手段山寨出了一个神奇的网站，这个网站可以计算出某两个人的所有共同祖先中辈分最低的一个是谁。远在美国的他们利用了一些奇妙的技术获得了国内许多人的相关信息，并且搭建了一个小小的网站来应付来自四面

Air RaidTime Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1422Appoint description:DescriptionConsider a town where all the streets a

E. Infinite Inversionstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is an infinite sequence consis

链接http://acm.hdu.edu.cn/showproblem.php?pid=5592ZYB's Premutation  Accepts: 218  Submissions: 983 Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Ot

L - Parity gameTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNow and then you play the following game with your friend. Your f

Query on a treeTime Limit: 5000msMemory Limit: 262144KBThis problem will be judged on SPOJ. Original ID: QTREE64-bit integer IO format: %lld      Java class name: MainPrev Submit S

E. Palisectiontime limit per test2 secondsmemory limit per test128 megabytesinputstandard inputoutputstandard outputIn an English class Nick had nothing to do a

HYSBZ - 2565最长双回文串Time Limit: 10000MS Memory Limit: 131072KB 64bit IO Format: %lld & %lluSubmit StatusDescription顺序和逆序读起来完全一样的串叫做回文串。比如acbca是回文串，而abc不是（abc的

HYSBZ - 2160拉拉队排练Time Limit: 10000MS Memory Limit: 265216KB 64bit IO Format: %lld & %lluSubmit StatusDescription艾利斯顿商学院篮球队要参加一年一度的市篮球比赛了。拉拉队是篮球比赛的一个看点

转自http://blog.youkuaiyun.com/u013368721/article/details/42100363今天我们来学习一个神奇的数据结构：Palindromic Tree。中译过来就是——回文树。那么这个回文树有何功能？假设我们有一个串S，S下标从0开始，则回文树能做到如下几点：1.求串S前缀0~i内本质不同回文串的个数（两个串长度不同或

``Dynamic'' InversionTime Limit: 3000msMemory Limit: 131072KBThis problem will be judged on UVA. Original ID: 1199064-bit integer IO format: %lld      Java class name: MainPrev Sub

树链剖分第一题QAQ，纪念下#pragma comment(linker, "/STACK:102400000,102400000")#include #include #include using namespace std;typedef long long ll;const ll mod = 1e9 + 7;const int maxn = 1e5 + 10;#d

Dylans loves treeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 747    Accepted Submission(s): 144Problem DescriptionDylans i

pog loves szh III  Accepts: 63  Submissions: 483 Time Limit: 12000/6000 MS (Java/Others)  Memory Limit: 131072/131072 K (Java/Others)问题描述pog在与szh玩游戏，首先pog在纸上画了一棵有根树，这里我们定义1为这

KPITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 205    Accepted Submission(s): 70Problem Description你工作以后, KPI 就是你的全部了. 我开发了一

B. Mike and Feettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike is the president of country What-The-F

A - 小Z的袜子(hose)Time Limit:20000MS     Memory Limit:265216KB     64bit IO Format:%lld & %lluSubmit Status Practice HYSBZ 2038Description作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。

DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Little

L -ParatroopersTime Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3308Appoint description:DescriptionIt is year 2500 A.D. and t

Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election cam

I - Tree SummingCrawling failedSubmit StatusAppoint description: System Crawler  (2014-05-29)Description Tree Summing BackgroundLISP was one of the

J - TreeTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler  (2014-05-16)Description  Tree 

K - QuadtreesTime Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler  (2014-01-02)Description Quadt

Description  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

#include #include#includeusing namespace std;#define INF 0xfffffffint inline parent(int i){return i>>1;}int inline left(int i){return 2*i;}int inline right(int i){return 2*i+1;}templatevoid i

三个水杯时间限制：1000 ms  |  内存限制：65535 KB难度：4描述给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行，第一行给出三

给出一个由加减乘除和括号构成的表达式计算表达式的值和表达式的前缀和后缀表达式#include#include#define Inf 1e9struct tree{ double date; char ch; tree *l,*r; tree() { ch='\0'; date=0; l=r=NULL