01 2015 档案

摘要:从白书上面的习题开始版切....但是发现时间不够了....今天粗略的做了不少题目.....但是有些题目感觉实在是比较诡异.......感觉考的话也不太可能...不过还是写下来吧. 1.Uva 10673 已知x, k, 求 x = p * floor(x / k) + q * ceil(x ... 阅读全文
posted @ 2015-01-26 22:59 Mr.Ren~
该文被密码保护。
posted @ 2015-01-20 18:12 Mr.Ren~
该文被密码保护。
posted @ 2015-01-20 17:54 Mr.Ren~
该文被密码保护。
posted @ 2015-01-20 16:47 Mr.Ren~
该文被密码保护。
posted @ 2015-01-18 22:27 Mr.Ren~
摘要:----------------------------------------------------转载-------------------------------------------------------- 应用1描述:n对括号有多少种匹配方式? 思路:n对括号相当于有2n个符号,... 阅读全文
posted @ 2015-01-16 19:09 Mr.Ren~
摘要:Problem JBitsInput:Standard InputOutput:Standard OutputAbitis a binary digit, taking a logical value of either "1" or "0" (also referred to as "true" ... 阅读全文
posted @ 2015-01-16 12:55 Mr.Ren~
摘要:1510 - Neon SignJungHeum recently opened a restaurant called ‘Triangle’ and has ordered the following neon sign for hisrestaurant. The neon sign has N... 阅读全文
posted @ 2015-01-15 22:56 Mr.Ren~
摘要:1350 - Pinary`Pinary" number is a positive number using only two digits ``0" and ``1" with usual rule that it must not begin with a 0, and the additio... 阅读全文
posted @ 2015-01-15 22:48 Mr.Ren~
摘要:12075 - Counting TrianglesTriangles are polygons with three sides and strictly positive area. Lattice triangles are the triangles all whose vertexes h... 阅读全文
posted @ 2015-01-15 22:38 Mr.Ren~
摘要:1393 - HighwaysHackerland is a happy democratic country withm×ncities, arranged in a rectangularmbyngrid and connected bymroads in the east-west direc... 阅读全文
posted @ 2015-01-15 22:28 Mr.Ren~
摘要:Problem E: How many 0's?A Benedict monk No. 16 writes down the decimal representations of all natural numbers between and includingmandn,m≤n. How many... 阅读全文
posted @ 2015-01-15 22:13 Mr.Ren~
摘要:E. Distributing PartsYou are an assistant director in a new musical play. The play consists of n musical parts, each part must be performed by exactly... 阅读全文
posted @ 2015-01-14 20:13 Mr.Ren~
摘要:D. Tennis GamePetya and Gena love playing table tennis. A single match is played according to the following rules: a match consists of multiple sets, ... 阅读全文
posted @ 2015-01-14 19:53 Mr.Ren~
摘要:Cow PatternsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 3414Accepted: 1263DescriptionA particular subgroup of K (1 2 #include 3 #include... 阅读全文
posted @ 2015-01-14 09:39 Mr.Ren~
摘要:Problem Description Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the nu... 阅读全文
posted @ 2015-01-12 22:30 Mr.Ren~
摘要:Lexicographical Substring SearchTime Limit: 1000MSMemory Limit: Unknown64bit IO Format: %lld & %lluDescriptionLittle Daniel loves to play with strings... 阅读全文
posted @ 2015-01-10 21:22 Mr.Ren~
摘要:Common SubstringsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 7605Accepted: 2524DescriptionA substring of a string T is defined as:T(i, k)... 阅读全文
posted @ 2015-01-10 20:55 Mr.Ren~
摘要:8222. SubstringsProblem code: NSUBSTRYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal ... 阅读全文
posted @ 2015-01-10 20:31 Mr.Ren~
摘要:一道比较好的树分治的题目.大力推荐~Query on the subtreeTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 479Accept... 阅读全文
posted @ 2015-01-10 19:52 Mr.Ren~
摘要:1812. Longest Common Substring IIProblem code: LCS2A string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the s... 阅读全文
posted @ 2015-01-09 20:49 Mr.Ren~
摘要:1811. Longest Common SubstringProblem code: LCSA string is finite sequence of characters over a non-empty finite set Σ.In this problem, Σ is the set o... 阅读全文
posted @ 2015-01-07 22:18 Mr.Ren~
摘要:Glass BeadsTime Limit: 3000MSMemory Limit: 10000KTotal Submissions: 2827Accepted: 1634DescriptionOnce upon a time there was a famous actress. As you m... 阅读全文
posted @ 2015-01-07 22:00 Mr.Ren~
摘要:2666. Query on a tree IVProblem code: QTREE4You are given a tree (an acyclic undirected connected graph) with N nodes, and nodes numbered 1,2,3...,N. ... 阅读全文
posted @ 2015-01-06 22:53 Mr.Ren~
摘要:我的树分治#3.After the success of 2nd anniversary (take a look at problem FTOUR for more details), this 3rd year, Travel Agent SPOJ goes on with another di... 阅读全文
posted @ 2015-01-05 20:35 Mr.Ren~
摘要:这个是非常经典的树分治的题目,关于60分的做法.参见poj1741按照树分治的惯例,先全局统计,然后再减掉重复的东西.那么如何计算贡献呢?我们按照poj1741的方法.先将满足一维的情况的数据全部放入一个树状数组里面,然后我们就能够一维统计了.复杂度O(nlog2n)代码也比较凑合....#incl... 阅读全文
posted @ 2015-01-04 21:49 Mr.Ren~
摘要:Cubes:我们先将每个正方形的光路投影找出来(在y轴上的截距所构成的区间)然后,我们再考虑按照光线射到的先后顺序加入每个方格。再用线段树统计这个投影区间内的最小高度的光线。这样我们就能够算出每个点被照亮的高度。复杂度O(n2logn+).注意:在计算区间的时候选择前闭后开区间,这是因为我们要满足两... 阅读全文
posted @ 2015-01-04 21:40 Mr.Ren~