LinzhiQQQ的博客

using namespace std;set:s;1.元素插入：s.insert()2.中序遍历：类似vector遍历（用迭代器）set::reverse_iterator rit=s.begin();while(rit!=s.end()){　　printf("%d",*rit++);}3.反向遍历：利用反向迭代器reverse_i

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7601    Accepted Submission(s): 2646Problem DescriptionCon

B. Tell Your Worldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputConnect the countless points with lines, till we re

 小Z的袜子(hose) HYSBZ - 2038 题意：有一个含 n 个数，下标从1 到 n 的序列，有m次询问，每次询问一个区间，问从区间里任意取两个数，两个数相同的概率是多少思路：区间查询，可以离线，所以也是莫队可以解决的先考虑如何求值的问题，对于一个区间，进来一个数 x，如果前面已经有k个x存在了，那么新进的这个x可以与前面的k个x组合成k个对子，所以Ans += fl...

Two Famous CompaniesTime Limit: 50000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1092    Accepted Submission(s): 322Problem DescriptionIn C

The Battle of ChibiTime Limit: 6000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2035    Accepted Submission(s): 714Problem DescriptionCao Cao

Ba Gua ZhenTime Limit: 6000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 874    Accepted Submission(s): 256Problem DescriptionDuring the Three

Game RoomsTime Limit: 4000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 814    Accepted Submission(s): 257Problem DescriptionYour company has

吉哥系列故事——完美队形IITime Limit : 3000/1000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 17   Accepted Submission(s) : 8Font: Times New Roman | Verdana | Georgia

color IITime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1126    Accepted Submission(s): 511Problem DescriptionYou are given an u

NPY and girlsTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1436    Accepted Submission(s): 491Problem DescriptionNPY's girlfri

TunnelsTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2398    Accepted Submission(s): 728Problem DescriptionBob is travelling

Weak PairTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3893    Accepted Submission(s): 1165Problem DescriptionYou are given

D - Gena's Code CodeForces - 614B 一道模拟题，寻找漂亮的数。题意：输入n个数，找到不漂亮的数。漂亮的数指只包含0和1的数并且最多只有一个1。当出现0的时候，就直接输出0。如果全是漂亮的数，就先输出一个1，再把所有零输出出来。如果有多个不漂亮的数，那就把这个数输出出来，然后再把其他0，输出出来（注意不要把最后那

E - Money Transfers CodeForces - 675C 训练题，这是一道想法题。题意：先输入一个n，表示有n个账户，然后输入n个值表示每个账户里的值，问最少转账多少次使得所有账户内都为0，因为有负数。思路：我们会发现在这一串数中，如果总共有n个数，并且里面能构成0的序列个数为m的话，那么只需要操作(n - m)次就可以完成操作了，所以我们

C. Anton and Fairy Taletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton likes to listen to fairy tales

一个人的旅行Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 35690    Accepted Submission(s): 12220Problem Description虽然草儿是个路痴（就是在杭电待了一

RewardTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8425    Accepted Submission(s): 2692Problem DescriptionDandelion's uncle i

这是一道字符串处理题目题目如下  点击打开链接ZgukistringZ 题意是 有三个字符串 a,b,c；我们要对这第一个字符串进行操作，改编里面字符的顺序，但不改变个数，使得改编后的字符串x 中包含有个数尽量多的 b 和 c 字符串（是加起来最多的情况）并且最后是b字符串在前，c字符串在后，最后再把剩下的多余的字符按ascii码顺序从小到大

Segment GameTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2086    Accepted Submission(s): 634Problem DescriptionLillian is a c

#1586 : Minimum时间限制:1000ms单点时限:1000ms内存限制:256MB描述You are given a list of integers a0, a1, …, a2^k-1.You need to support two types of queries:1. Output Minx,y∈[l,r] 

JLUCPCTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1390    Accepted Submission(s): 422Problem DescriptionDr. Skywind and Dr.

CRB and TreeTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2244    Accepted Submission(s): 683Problem DescriptionCRB has a tree

Capturing a countryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1321    Accepted Submission(s): 542Problem DescriptionAnt and

AtlantisTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16397    Accepted Submission(s): 6691Problem DescriptionThere are several ancient Greek ...

Problem C. Dynamic Graph MatchingTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1341    Accepted Submission(s): 561Problem Description...

HDU 6395 传送门题目里有公式显示不了，直接传送门公式：  F1 = A     F2 = B    Fn  =  Fn-2 * C   +  Fn-1 * D  +  P / n其中 A B C D P n 均为不定值，  P / n 为计算机整数除法，即向下取整很明显的是  前 2 项 * C  +  前 1 项 * D，所以矩阵很好构造:mat: D ...

Problem B. Harvest of ApplesTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1039    Accepted Submission(s): 390Problem DescriptionThere...

RMQ算法求解的是区间最值问题，比如求区间最大值例如一个数列 9 5 3 4 1 8 7 2 9 5 ，多次询问，每次询问任意一个区间的最大值ST表: 一个通过动态规划预处理生成的表，时间复杂度为 O(nlogn)，但是查询时间为 O(1)首先 st[ i ][ j ] 表示 从下标 i 开始，长度为 2^j 的区间里的最大值那么对于一个区间  [a,b] ，它的最大值 = max...

题意：给出 n m x y z，表示有一个含有 n 个元素的数组，有 m 次操作，这 m 次操作要通过一个函数的结果得出的使用给出的 x y z 可以把 f函数 1 到 3 * m 的值先算出来，然后m次操作里使用 f 函数的值去算出 l   r   v操作就是对数组上 [ l , r ] 的区间做更新，如果  v > a[ i ] 那么就把 a [ i ] 的值更新为 v最...

Taotao Picks ApplesTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 961    Accepted Submission(s): 283 Problem DescriptionThere is an a...

Character EncodingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 898    Accepted Submission(s): 349 Problem DescriptionIn computer sc...

Problem L.VideosTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 389    Accepted Submission(s): 191Problem DescriptionC-bacteria takes c...

---->>>>>   传送门   <<<<<----题意：纳什均衡指的是某个数在一个矩阵中的某个位置的时候，它同时是这一行和这一列里最大的数现在要求你构造出矩阵，矩阵里的数为 [ 1 , n*m ] 的不同的数，要使得矩阵里只有一个位置满足纳什均衡，然后给出矩阵的规格给出一个取模的值，要求有多少种构造方法思路：首先这个纳...

There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}ith kind of ship is 2^{C[i]} - 12C[i]−1. How many d...

WerewolfTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 957    Accepted Submission(s): 259Problem Description"The Werewolves" is a popu...

Problem A. Ascending RatingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 2101    Accepted Submission(s): 636 Problem DescriptionBef...

传送门2370 小机房的树 时间限制: 1 s 空间限制: 256000 KB 题目等级 : 钻石 Diamond 题解 查看运行结果题目描述 Description小机房有棵焕狗种的树，树上有N个节点，节点标号为0到N-1，有两只虫子名叫飘狗和大吉狗，分居在两个不同的节点上。有一天，他们想爬到一个节点上去搞基，但是作为两只虫子，他们不想花费太多精力。已知从某个节点

D - Shovel Sale CodeForces - 899D 题意：输入一个数 n ，表示你拥有 1 - n 的数，你可以将数字两两组合相加，现在要求在你的组合出的数字中尾数9的个数最多比如 199 中尾部9的个数最多 。 99999909 中尾数9 的个数只有 一个现在的要求条件：1、尾数9最多  2、有多少种组合 3、尾数9个数为0也算所以  如果输入 4  ，答案是 6 {(1,2) ...

RewardTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11085    Accepted Submission(s): 3548Problem DescriptionDandelion's uncle is a boss of a f...