2014年08月_码代码的猿猿的AC之路

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 Codeforces 461C. Appleman and a Sheet of Paper

每次只把短的部分往长的部分折叠，直接用树状数组爆搞就可以了。每次长度都缩小一些暴力的复杂度不是太高，启发式暴力？？？？C. Appleman and a Sheet of Papertime limit per test2 secondsmemory limit per test256 megabytesinputstanda

2014-08-30 14:24:54 1162

原创 Codeforces 461 B. Appleman and Tree

树形DP。。。B. Appleman and Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman has a

2014-08-30 14:19:39 1239

原创 HDOJ 1823 Luck and Love

二维线段树模版题。。。Luck and LoveTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5397 Accepted Submission(s): 1348Problem Descripti

2014-08-29 21:46:43 846

原创 HDOJ 4819 Mosaic

裸的二维线段树。。。。MosaicTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 494 Accepted Submission(s): 177Problem Description

2014-08-29 15:51:00 969

原创 HDOJ 4815 Little Tiger vs. Deep Monkey

递推...Little Tiger vs. Deep MonkeyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 661 Accepted Submission(s): 244Problem Des

2014-08-28 10:47:11 1291

原创 HDOJ 4821 String

字符串hashStringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 697 Accepted Submission(s): 190Problem DescriptionGive

2014-08-28 01:40:05 1296

原创 HDOJ 4814 Golden Radio Base

利用题目中给出的公式和hint可以得到两个有用的公式：phi^(n) = phi^(n-1)+phi^(n-2)2*(phi^n) = phi^(n+1)+phi^(n-2)可以计算出phi^100远大于10^9，所以推测最后得到的phi进制的数整数和小数部分应该不会超过100位，事实表明，50位就能过。所以最终变成了简单的模拟。Golden Radio Base

2014-08-28 00:14:27 1333 1

原创 UVA 11992 Fast Matrix Operations

每一行都建一个线段树。。。。Fast Matrix OperationsThere is a matrix containing at most 106 elements divided into r rows and c columns. Each element has a location (x,y) where 11 x1 y1 x2 y2 v

2014-08-27 16:59:57 1083

原创石子合并的动态规划问题

题目大概都是这样的：设有N堆沙子排成一排，其编号为1，2，3，…，N（Ndp的方程很显然：区间DP dp[i][j]=min(dp[i][k]+dp[k+1][j]+cost[i][j]) i复杂度 N^3这同时也是一个四边形优化DP的标准形式，对于i到j段的最优值s[i][j]满足： s[i][j-1]可以减小枚举范围，复杂度N^2

2014-08-27 11:27:40 2004

原创 HDOJ 3516 Tree Construction

四边形优化DPTree ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 868 Accepted Submission(s): 470Problem Description

2014-08-25 23:38:33 931

原创 HDOJ 4983 Goffi and GCD

题意：给你 N 和 K,问有多少个数对满足 gcd(N-A, N) * gcd(N - B, N) = N^K分析：由于 gcd(a, N) 2 都是无解,K=2 只有一个解 A=B=N,只要考虑 K = 1 的情况就好了其实上式和这个是等价的 gcd(A, N) * gcd(B, N) = N^K,我们枚举 gcd(A, N) = g,那么gcd(B, N) = N / g。问题转化为

2014-08-25 16:15:54 1124

原创 HDOJ 4982 Goffi and Squary Partition

Goffi and Squary PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 374 Accepted Submission(s): 145Problem DescriptionR

2014-08-25 13:32:56 942

原创 SWERC13 Decoding the Hallway

找规律 S+1 = S +'L'+~rev(S)Problem DDecoding the HallwayProblem DEdward is now 21 years old. He has to appear in an exam to renew his State Alchemisttitle. This year the exam is arranged

2014-08-25 01:24:02 1307

原创 SWERC13 Trending Topic

map暴力。。。Imagine you are in the hiring process for a company whose principal activity is the analysisof information in the Web. One of the tests consists in writing a program for maintaining up

2014-08-25 01:21:15 1689

原创 Codeforces 460 D. Little Victor and Set

暴力+构造If r - l ≤ 4 we can all subsets of size not greater than k. Else, if k = 1, obviously that answer is l. If k = 2, answer is 1, because xor of numbers 2x and 2x + 1 equls 1. If k ≥

2014-08-24 11:20:21 1125

原创 HDOJ 2829 Lawrence

四边形不等式优化DPLawrenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2220 Accepted Submission(s): 975Problem DescriptionT.

2014-08-24 00:02:25 1070

转载四边形不等式

转自：当函数w(i,j)满足 w(a,c)+w(b,d) 四边形不等式。。当函数w(i, j)满足w(i', j) 称w关于关于区间包含关系单调。 s(i, j)=k是指m(i, j)这个状态的最优决策以上定理的证明自己去查些资料今天看得lrj的书中介绍的四边形优化做个笔记，加

2014-08-23 21:48:09 805

原创 HDOJ 3669 Cross the Wall

斜率优化DP。。。按w递减，w相等h递增的顺序排序，扫一遍让w递减h递增dp[now][i]=min( dp[pre][j]+W[j+1]*H[i]) k-1维护一个下凸的曲线，斜率优化Cross the WallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 327680/327680

2014-08-23 01:12:51 1392

原创 HDOJ 4974 A simple water problem

A simple water problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 173 Accepted Submission(s): 112Problem DescriptionDrago

2014-08-21 22:20:54 912

原创 HDOJ 4972 A simple dynamic programming problem

找规律。。。数据可能不合法。。。输出0A simple dynamic programming problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 85 Accepted Submission(s): 3

2014-08-21 18:44:58 1103

原创 Codeforces Round #262 (Div. 2) A，B，C

A. Vasya and Sockstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n pairs of socks. In the mornin

2014-08-21 09:48:53 1455

原创 HDOJ 4965 Fast Matrix Calculation

(AB)^n=A*(BA)^(n-1)^BFast Matrix CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 576 Accepted Submission(s): 297

2014-08-20 21:57:15 902

原创 HDOJ 4964 Emmet

递归语法翻译。。。EmmetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 138 Accepted Submission(s): 44Problem DescriptionFor ev

2014-08-20 01:30:04 1195

原创 HDOJ 4968 Improving the GPA

枚举。。。Improving the GPATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 158 Accepted Submission(s): 126Problem Description

2014-08-19 21:00:27 912

原创 HDOJ 4970 Killing Monsters

明明扫一遍的题目，比赛的时候居然用线段树。。。TLE 5发。。。Killing MonstersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 225 Accepted Submission(s): 128

2014-08-19 19:31:07 722

原创 HDOJ 3507 Print Article

斜率优化DPPrint ArticleTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5519 Accepted Submission(s): 1707Problem Descriptio

2014-08-18 20:49:00 845

原创 HDOJ 3480 Division

斜率优化DP。。。。对数组排序后，dp【i】【j】表示对前j个物品分i段的最少代价，dp【i】【j】= min｛ dp【i－1】【k】+（a【k+1】－a【j】）^2 }复杂度m*n^2 斜率优化一下就可以了。DivisionTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 999999/400000 K

2014-08-18 14:01:27 879

原创 Codeforces Round #261 (Div. 2)

Codeforces Round #261 (Div. 2)A. Pashmak and Gardentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

2014-08-17 11:49:19 2015

原创 POJ 2018 Best Cow Fences

斜率优化DP。。。《浅谈数形结合思想在信息学竞赛中的应用安徽省芜湖一中周源》例题。。。Best Cow FencesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9311 Accepted: 2986Description

2014-08-14 23:06:25 1009

原创 HDOJ 4259 Double Dealing

找每一位的循环节，求lcmDouble DealingTime Limit: 50000/20000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1806 Accepted Submission(s): 622Problem De

2014-08-14 00:35:04 828

原创 HDOJ 4944 FSF’s game

http://blog.csdn.net/keshuai19940722/article/details/38519681不明真相的补一发。。。FSF’s gameTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s)

2014-08-13 21:34:36 1022

原创 HDOJ 4937 Lucky Number

当进制转换后所剩下的为数较少时（2位，3位），对应的base都比较大，可以用数学的方法计算出来。预处理掉转换后位数为3位后，base就小于n的3次方了，可以暴力计算。。。。Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submissio

2014-08-13 00:37:28 1301

原创 HDOJ 4941 Magical Forest

STL map 记录对应原图是第几行/列Magical ForestTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 394 Accepted Submission(s): 188Proble

2014-08-12 23:20:12 935

原创 HDOJ 4939 Stupid Tower Defense

red放到后面显然更优，dp【i】【j】表示前i个塔里有j个blue，最后枚举有多少个redStupid Tower DefenseTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 599 Accepted S

2014-08-12 21:52:09 815

原创 HDOJ 4915 Parenthese sequence

Parenthese sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 716 Accepted Submission(s): 335Problem Descriptionbobo f

2014-08-12 09:52:55 1056

原创 HDOJ 3944 DP?

尽量沿着边走距离最短，化减后 C（n+1，k）+ n - k，预处理阶乘，Lucas定理组合数取模DP?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 128000/128000 K (Java/Others)Total Submission(s): 1899 Accepted Submissi

2014-08-11 00:37:43 1140

原创 BZOJ 1901 Zju2112 Dynamic Rankings

树状数组套主席树，维护区间动态第K大。。。ZOJ给的空间太小，而主席树要求的空间太大，只能到BZOJ上交1901: Zju2112 Dynamic RankingsTime Limit: 10 Sec Memory Limit: 128 MBSubmit: 4186 Solved: 1754[Submit][Status]Description给定一个含

2014-08-10 22:04:00 830

原创 HDOJ 3037 Saving Beans

假设有n+1个树，第n+1个树埋不足m的种子，隔板法C【n+m】【m】大组合数取mod用Lucas定理:Lucas(n,m,p) = C[n%p][m%p] × Lucas(n/p,m/p,p) ;Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K

2014-08-10 17:57:57 1238

转载【转】逆元的几种求法

点击打开链接定义 a * x = 1(mod p), 求x1、扩展欧几里德：令ax + py = 1Gcd的本质就是进行迭代，不断缩小范围。不详细讲。。参考：http://baike.baidu.com/view/1478219.htm 2、根据费马小定理：若(a，p)互质，且p为质数：则 a ^ (

2014-08-10 17:09:52 1175

原创 HDOJ 4923 Room and Moor

用一个栈维护b的值，每次把一个数放到栈顶。看栈首的值是不是大于这个数，如果大于的话将栈顶2个元素合并，b的值就是这两个栈顶元素的平均值。。。Room and MoorTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s):

2014-08-10 15:23:45 878