YY
文章平均质量分 62
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
LightOJ - 1259 Goldbach`s Conjecture
DescriptionGoldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of t原创 2015-07-09 20:36:21 · 725 阅读 · 0 评论 -
CodeForces 664B Rebus (调整策略)
DescriptionYou are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by arithmetic operation '+' and '-', equality and positive integer n. The goal is to repl原创 2016-04-22 17:25:41 · 727 阅读 · 0 评论 -
CodeForces 659E New Reform (图的遍历判环)
DescriptionBerland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It isnot guaranteed that y原创 2016-04-22 18:27:53 · 1506 阅读 · 0 评论 -
ZOJ 3939 The Lucky Week (400年一个周期)
The Lucky WeekTime Limit: 2 Seconds Memory Limit: 65536 KB Edward, the headmaster of the Marjar University, is very busy every day and always forgets the date.There was one day Edwa原创 2016-04-23 23:42:09 · 987 阅读 · 0 评论 -
HDU 4608 I-number(YY)
I-numberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3969 Accepted Submission(s): 1416Problem DescriptionThe I-number of x原创 2016-07-06 11:20:59 · 1038 阅读 · 0 评论 -
Codeforces 388B Fox and Minimal path(构造)
题意: 给出一个数字k,要求你构造一张无向图使得点1到点2的最短路径恰好有k条首先将k二进制化,然后看图就明白怎么构造了: 首先构造出最大的2的指数级部分,然后接下来在此链上继续并联一些点#include<cstring>#include<cstdio>#include<algorithm>#include<iostream>#include<map>using namespace原创 2016-08-31 16:45:39 · 446 阅读 · 0 评论 -
CodeForces 707D Persistent Bookcase (操作建树DFS|主席树+主席树)
题意: 给出一个n*m的书柜,有四种操作 1 i j — Place a book at position j at shelf i if there is no book at it. 在i行j列放一本书,如果已有书则不放 2 i j — Remove the book from position j at shelf i if there is a boo原创 2016-08-22 14:02:35 · 694 阅读 · 0 评论 -
HDU 5869 Different GCD Subarray Query(计数区间不同GCD)
题意:给出一个序列,m次询问,每次询问某个闭区间内所有的子区间组成的不同GCD有多少个对于一个长度为n的序列来说,组成的不同GCD值不会超过n*logn个,所对应的区间也是如此,预处理出每个下标对应的所有不同gcd区间,右端点排序,对询问离线处理,右端点排序,通过树状数组计数不同的gcd值得到答案#include<cstring>#include<string>#include<iostream原创 2016-09-13 11:44:23 · 528 阅读 · 0 评论 -
CodeForces 208E Blood Cousins(树剖求lca + dfs序)
题意: 给出若干棵树,q次询问,每次询问某结点n向上k步的父节点的子树中有多少个和n是兄弟结点(深度相同) ps:这里的题意是将问题简化过后的 假设现在只有一棵树,首先考虑结点的子树如何确定,dfs序可以解决,再考虑向上k步的lca如何解决,倍增法求lca(弱不会),由于只会树剖向上爬,外加上树剖可以直接处理dfs序,所以就写树剖了…对于子树内符合条件的结点,只需要开10510^5个深度的ve原创 2016-09-02 10:31:21 · 531 阅读 · 0 评论 -
HDU 4348 SPOJ TTM To the moon(操作建树)
题意:给出一个序列,四种操作C l r d: Adding a constant d for every {Ai | l <= i <= r}, and increase the timestamp by 1, this is the only operation that will cause the timestamp increase. Q l r: Querying the current原创 2016-08-24 14:21:10 · 435 阅读 · 0 评论 -
CodeForces 632C The Smallest String Concatenation
You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.Given the list of strin原创 2016-04-22 16:18:28 · 594 阅读 · 0 评论 -
CodeForces 660C Hard Process (队列)
DescriptionYou are given an array a with n elements. Each element of a is either0 or 1.Let's denote the length of the longest subsegment of consecutive elements in a, consisting of only nu原创 2016-04-22 16:10:43 · 571 阅读 · 0 评论 -
ZOJ 1101 Gamblers (A=B+C+D)
题意:给出n个数字(包含负数),从中找到一个最大A的数满足 A=B+C+D A,B,C,D均为在这n个数中且不同分析:n最大为1000,如果n^3去解决会很呛,我们不防先将式子变形 A-B=C+D,这样先n*n预处理出C+D的所有值,然后枚举A,B,这样就能在n*n*log(n*n)的复杂度内解决问题了,要注意的是由于有负数,所以每次枚举都要遍历整个数组。#include原创 2016-05-24 21:05:21 · 709 阅读 · 0 评论 -
Hdu 5386 Cover 拓扑排序
CoverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 346 Accepted Submission(s): 112Special JudgeProblem DescriptionYou hav原创 2015-08-13 20:49:45 · 628 阅读 · 0 评论 -
hdu 5292 Pocket Cube
Pocket Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 92 Accepted Submiss原创 2015-07-22 20:02:36 · 538 阅读 · 0 评论 -
hdu 5299 Circles Game
Circles GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 150Problem DescriptionThere are n原创 2015-07-22 20:59:55 · 907 阅读 · 0 评论 -
Spreadsheets (26进制转换)
SpreadsheetsTime Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionIn the popular spreadsheets systems (for example, in Excel) the following numeration of co原创 2016-03-21 17:20:53 · 488 阅读 · 0 评论 -
codeforces 143 C.To Add or Not to Add (YY 二分 处理一下前缀和)
首先答案一定在已有数列中,那么将数列排序,从小到大找每个数在它之前能满足条件囊括的所有数,前缀和预处理一下中间差值即可,时间复杂度n*log(n)。#include#include#include#include#include#include#include#include#include#include//#pragma comment(linker, "/ST原创 2016-04-04 11:54:10 · 637 阅读 · 0 评论 -
CodeForces 622C Not Equal on a Segment
Not Equal on a SegmentTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionYou are given array a with n integers and m queries. Thei-th query is gi原创 2016-04-06 23:16:30 · 634 阅读 · 0 评论 -
CodeForces 622E Ants in Leaves (贪心策略 递推公式)
Ants in LeavesTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionTree is a connected graph without cycles. A leaf of a tree is any vertex connected w原创 2016-04-07 19:13:46 · 885 阅读 · 0 评论 -
CodeForces 589D Boulevard (一维区间判断相交 非线段交做法)
BoulevardTime Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64uDescriptionWelcoming autumn evening is the best for walking along the boulevard and n people decid原创 2016-04-11 23:24:11 · 626 阅读 · 0 评论 -
Codeforces 652 B. z-sort
B. z-sortA student of z-school found a kind of sorting calledz-sort. The array a withn elements are z-sorted if two conditions hold:ai ≥ ai - 1 for all eveni, ai ≤ ai - 1 for all o原创 2016-03-26 11:03:30 · 573 阅读 · 0 评论 -
RSA 平方-乘算法 与 快速幂
平方乘算法和快速幂是极为相似的两种快速计算aka^k的方法,其不同点在于处理二进制的顺序相反,方法也有所差异复,杂度都为log2(k)log_2(k)基本原理: aka^k,将kk表示为二进制形式则得到abk...b2b1b0a^{b_k...b_2b_1b_0},其中bkb_k为高位,b0b_0为低位。 将abk...b2b1b0a^{b_k...b_2b_1b_0}变形得到ab...bb1b原创 2016-12-28 20:39:15 · 16538 阅读 · 8 评论