2017年03月_阿.荣.

原创 codeforce 789 C. Functions again (最大字段和)

C. Functions againtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomething happened in Uzhlyandia again...

2017-03-30 22:19:56 528

原创 codeforces 789 B. Masha and geometric depression (暴力+细节)

B. Masha and geometric depressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMasha really loves algebra

2017-03-30 22:13:00 879 1

原创 code forces 791 C. Bear and Different Names (思维)

C. Bear and Different Namestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the army, it isn't easy to fo

2017-03-29 22:17:37 291

原创 codeforces 791 B. Bear and Friendship Condition (DFS搜索)

B. Bear and Friendship Conditiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak examines a socia

2017-03-29 22:14:52 293

原创 poj 1365 Prime Land (数学--唯一分解定理)

Prime LandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4098 Accepted: 1856DescriptionEverybody in the Prime Land is using a prime base number syste

2017-03-28 21:39:20 455

原创唯一分解定理

定理：任意一个大于1 的正整数都能表示成若干个质数的乘积，且表示方法是唯一的。换句话说一个数能被唯一的分解成若干质因数的乘积，成为唯一分解定理。推论：若p是ab的因子，那么p一定是a或b的因子。证明：质数p不能整除a，告诉我们a和p互质，于是存在整数k和l使得ka + lp = 1。等式两边同时乘以b，我们有kab + lpb = b。而ab能被p整除，也即存在整数r使得ab=pr。那

2017-03-28 20:36:17 884

原创 poj 1126 Simply Syntax (反向枚举)

Simply SyntaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5552 Accepted: 2482DescriptionIn the land of Hedonia the official language is Hedonian. A

2017-03-26 21:25:55 379

原创 poj 2255 Tree Recovery (二叉树的顺序遍历)

Tree RecoveryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14636 Accepted: 9087DescriptionLittle Valentine liked playing with binary trees very much

2017-03-24 21:29:27 251

原创 hdoj 1027 Ignatius and the Princess II (全排列)

Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7892 Accepted Submission(s): 4661Problem DescriptionN

2017-03-24 20:08:09 336

原创 codeforces 785 C. Anton and Fairy Tale (数学二分搜索)

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

2017-03-21 19:55:05 361

原创 poj 2549 Sumsets (折半枚举)

SumsetsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11139 Accepted: 3047DescriptionGiven S, a set of integers, find the largest d such that a + b +

2017-03-20 20:23:12 350

原创 poj 1664 放苹果 (递推)

放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33295 Accepted: 20648Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。

2017-03-20 20:16:43 403

原创 codeforces 140 A. New Year Table

A. New Year Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald is setting the New Year table. The

2017-03-15 18:49:12 498

原创 poj 2719 Faulty Odometer (数学思维)

Faulty OdometerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9277 Accepted: 5744DescriptionYou are given a car odometer which displays the miles

2017-03-15 17:14:10 365

原创 hdoj 5969 最大的位或 (位或)

最大的位或Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1182 Accepted Submission(s): 477Problem DescriptionB君和G君聊天的时候想到了如下的问题。

2017-03-14 21:12:26 390

原创 poj 2718 Smallest Difference (STL 暴力枚举)

Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10413 Accepted: 2844DescriptionGiven a number of distinct decimal digits, you can f

2017-03-14 21:04:47 236

原创 hdoj 1466 计算直线的交点数 (几何 DP)

计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9799 Accepted Submission(s): 4468Problem Description平面上有n条直线，且无三线共点，问

2017-03-12 18:11:20 395

原创 hdoj 5635 LCP Array (模拟)

LCP ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1564 Accepted Submission(s): 480Problem DescriptionPeter has a str

2017-03-12 17:42:55 266

原创 poj 2104 K-th Number (分桶法和平方分割)

K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 53887 Accepted: 18530Case Time Limit: 2000MSDescriptionYou are working for Macrohard

2017-03-12 17:12:29 1195

原创 hdoj 5344 MZL's xor (简单异或)

MZL's xorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1264 Accepted Submission(s): 784Problem DescriptionMZL loves xor ver

2017-03-10 19:48:19 333

原创 hdoj 5311 Hidden String (暴力枚举)

Hidden StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1950 Accepted Submission(s): 724Problem DescriptionToday is th

2017-03-10 19:18:03 290

原创 hdoj 5444 Elven Postman (二叉树创建+查找)

Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1833 Accepted Submission(s): 1049Problem DescriptionElves are

2017-03-08 20:56:19 207

原创 hdoj 5666 Segment ( 数学几何 +快速积)

SegmentTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1756 Accepted Submission(s): 647Problem Description Silen August

2017-03-08 18:22:16 591

原创 CF 782 B. The Meeting Place Cannot Be Changed (二分搜索)

B. The Meeting Place Cannot Be Changedtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe main road in Byt

2017-03-06 19:21:56 285

原创 51nod 1202 子序列个数 (组合数学 +动态规划)

1202 子序列个数题目来源：福州大学 OJ基准时间限制：1 秒空间限制：131072 KB 分值: 40 难度：4级算法题收藏关注子序列的定义：对于一个序列a=a[1],a[2],......a[n]。则非空序列a'=a[p1],a[p2]......a[pm]为a的一个子序列，其中1例如4,14,2,3和14,1,

2017-03-05 20:11:52 429

原创 51nod 1086 背包问题 V2 (多重背包问题)

1086 背包问题 V2基准时间限制：1 秒空间限制：131072 KB 分值: 40 难度：4级算法题收藏关注有N种物品，每种物品的数量为C1，C2......Cn。从中任选若干件放在容量为W的背包里，每种物品的体积为W1，W2......Wn（Wi为整数），与之相对应的价值为P1,P2......Pn（Pi为整数）。求背包能够容

2017-03-05 20:04:28 555

原创 51Nod 1051 最大子矩阵和 (最大子段和变形)

1051 最大子矩阵和基准时间限制：2 秒空间限制：131072 KB 分值: 40 难度：4级算法题收藏关注一个M*N的矩阵，找到此矩阵的一个子矩阵，并且这个子矩阵的元素的和是最大的，输出这个最大的值。例如：3*3的矩阵：-1 3 -12 -1 3-3 1 2和最大的子矩阵是：3

2017-03-04 16:27:40 2273

原创 51Nod 1050 循环数组最大子段和 (最大字段和)

1050 循环数组最大子段和N个整数组成的循环序列a[1],a[2],a[3],…,a[n]，求该序列如a[i]+a[i+1]+…+a[j]的连续的子段和的最大值（循环序列是指n个数围成一个圈，因此需要考虑a[n-1],a[n],a[1],a[2]这样的序列）。当所给的整数均为负数时和为0。例如：-2,11,-4,13,-5,-2，和最大的子段为：11,-4,13。和为20。

2017-03-04 13:22:19 1112

R