不会吃鱼的喵

链接：http://codeforces.com/problemset/problem/831/E思路：看成一个环，每次找到一个上次移除位置的前面一个最小值的位置，计算位置差，已经移除的空位用树状数组维护。//QAQ//#pragma comment(linker, "/stack:1024000000,1024000000") #include <bits/stdc++.h>...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5695Problem Description众所周知，度度熊喜欢各类体育活动。 今天，它终于当上了梦寐以求的体育课老师。第一次课上，它发现一个有趣的事情。在上课之前，所有同学要排成一列， 假设最开始每个人有一个唯一的ID，从1到N，在排好队之后，每个同学会找出包括自己

链接：https://www.patest.cn/contests/gplt/L3-002L3-002. 堆栈时间限制200 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越大家都知道“堆栈”是一

题目链接：http://codeforces.com/contest/383/problem/CDescriptionIahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes nu

Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 15889 Accepted: 4571DescriptionAfter a long lasting war on words, a war on arms fina

题目链接：http://poj.org/problem?id=1741大致题意：给定一棵N(1vu,两点间的最短路径长度，路径的长度定义为路径上所有边的权和。再给定一个K(1足dist(a,b)求合法点对个数。 大致题解：（参考国家集训队论文：http://wenku.baidu.com/link?url=7KOPn20aLvKK5PqDmuLjIyj4sqZ6CL

InputThe first line contains an integer t meaning that there are t test cases(t For each test case:The first line is an integer n meaning that there are n cities(2 Then n lines follow. Each li

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5700Problem Description小A有一个含有n个非负整数的数列与m个区间。每个区间可以表示为li,ri。它想选择其中k个区间， 使得这些区间的交的那些位置所对应的数的和最大。例如样例中，选择[2,5]与[4,5]两个区间就可以啦。Input多组测试数据第

How far away ？Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThere are n houses in the

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5692Description百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都有一个值v，表示为小度熊提供零食的价值。由于零食被频繁的消耗和补充，零食机的价值v会时常发生变化。小度熊只能从编号为0的零食机出发，并且每个零食机至多经过一次。

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5723题意：无向图求最小生成树，以及两点之间距离的期望。题解：kru求最小生成树，然后DFS出每条边所用到的次数（两边点数乘积）。CODE：#include using namespace std;const int MAXM = 1e6+7;const int MAX

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5775题意：根据题目中的冒泡排序方法，问排序过程中每个数据的最大位移差。题解：观察代码可以知道当前数字移动之前需要先把其后面小的数移动到前面，那么得到最右位置，最左位置取排序前位置和排序后位置的最小值即可。考虑一个位置上的数字c在冒泡排序过程的变化情况。c会被其后面比c小的数字各交换一次

链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5595大致题意：用给出的数列a1,a2,a3....an构造二叉树，满足对于下标i和j，有i正序建树模拟一下，找到小于等于当前权值的一个可插入最大值，成为其子节点，找不到则新建树。#include using namespace std;

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5068根据每层两个点的到下一层两个点的连接情况，可以得到一个2*2的矩阵，初始矩阵全部联通都为1，不连通为0，显然一段区间内的方案数就是区间内矩阵相乘后的矩阵行列值求和。简单的线段树维护区间矩阵乘积就好。#pragma comment(linker, "/STACK:1024000000,1

链接：http://poj.org/problem?id=3026水题，注意数组大小，测试数据有点坑。#pragma comment(linker, "/STACK:1024000000,1024000000")#include #include #include #include #include #include #include #include u

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5828题意：三个操作：1 l r x  :区间[l,r]每个数加x2 l r    :区间[l,r]每个数开根3 l r    :区间[l,r]求和题解：重点在于开根，易知开根的递减是很快的，区间内数开根后会趋于相等，所以可以维护相等区间，但是发现一个平方数与其减1的数构

链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=5862题意：给出与坐标轴平行的线段，求所有线段的交点个数题解：先将数据离散化，将两类线段分开存放；考虑横向线段的左右端点，将y值计数，只需将竖向线段扫描一遍，统计y1与y2之间的线段个数，维护bit就好。CODE：#include //#pragma comment(linke

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5877题意：给定一棵树求解满足以下条件的点对个数1，对于(u,v)，u为v的祖先节点2，对于(u,v)，有au*av题解：DFS过程中维护a[i]的bit，查找k/a[i]，数据只有10W离散化以下就好。CODE：#include //#pragma comment

链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=3966题意：给出一棵树，I C1 C2 K: 把C1与C2的路径上的所有点权值加上KD C1 C2 K：把C1与C2的路径上的所有点权值减去KQ C：查询节点编号为C的权值题解：树链剖分CODE：#include #pragma

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5792题意：给出一个长度为n的整数序列，求有多少个四元组{a,b,c,d}。满足1Vd 题解：对于a[i]，预先处理出：ll[i]: [0,i-1]小于a[i]的个数lh[i]: [0,i-1]大于a[i]的个数rl[i]: [i+1,n-1]小于a[i]的个数r

Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 11004 Accepted: 3864Case Time Limit: 1000MSDescriptionFarmer John's cows refused t

E - Road ConstructionCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionIt's almost s

Hire and FireTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2342 Accepted: 667DescriptionIn this problem, you are asked to keep track of the hierarch

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21976 Accepted: 11499DescriptionA rooted tree is a well-known data structure i

BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36929 Accepted: 15737DescriptionYou have just moved from Waterloo to a big city. The people her

Language:DefaultStarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37695 Accepted: 16418DescriptionAstronomers often examine star maps where sta

小希的迷宫Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36197    Accepted Submission(s): 11069Problem Description上次Gardon的迷宫城堡小希玩了很久（见P

Language:DefaultClosest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 17367 Accepted: 5573DescriptionWrite a program that takes

Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 27713 Accepted: 13576DescriptionThere are so many different religions in the world t

D - War（8.4.3）Crawling in process...Crawling failedTime Limit:3000MS    Memory Limit:0KB     64bit IO Format:%lld & %lluSubmit Status DescriptionProblem B: War      A

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36511 Accepted: 11201DescriptionThe police office in Tadu City decides to say end

A - Apple Tree（8.3.1）Crawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionThere is an a

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 19694 Accepted: 8261DescriptionAn earthquake takes place in Southeast Asia. The ACM (

Language:DefaultBalanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 41073 Accepted: 19301Case Time Limit: 2000MSDescriptionFor th

Language:DefaultBalanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 41072 Accepted: 19300Case Time Limit: 2000MSDescriptionFor th

B - A Simple Problem with IntegersCrawling in process...Crawling failedTime Limit:5000MS    Memory Limit:131072KB     64bit IO Format:%I64d & %I64u SubmitStatus Description

C - Count the ColorsCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmitStatus DescriptionPainting some colore

Tree GraftingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2055 Accepted: 904DescriptionTrees have many applications in computer science. Perhaps the mo

TravelProblem DescriptionJack likes to travel around the world, but he doesn’t like to wait. Now, he is traveling in the Undirected Kingdom. There aren cities and mbidirectional roads co

D - Hardwood SpeciesCrawling in process...Crawling failedTime Limit:10000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionHardwoods are the