2015年09月__zidaoziyan

原创 Codeforces Round #322 D.Three Logos

D. Three Logostime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThree companies decided to order a billboard with pictu

2015-09-29 15:32:45 528

原创 hdu5480Conturbatio(好题)

ConturbatioTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 156 Accepted Submission(s): 79Problem DescriptionThere are many rook

2015-09-26 22:44:14 700

原创 hdu5479Scaena Felix(好题)

Scaena FelixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 105 Accepted Submission(s): 52Problem DescriptionGiven a parenthese

2015-09-26 22:08:24 685

原创 hdu5475 An easy problem(好题)

An easy problemTime Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 113 Accepted Submission(s): 55Problem DescriptionOne day, a usel

2015-09-26 18:44:39 1475

原创 poj2289Jamie's Contact Groups(好题)

Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 7026 Accepted: 2323DescriptionJamie is a very popular girl and has quite a lot of fr

2015-09-25 20:04:02 609

原创 poj 2594 Treasure Exploration(好题)

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7408 Accepted: 3029DescriptionHave you ever read any book about treasure exploration?

2015-09-25 18:41:43 292

原创 hdu149850 years, 50 colors(好题)

50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1971 Accepted Submission(s): 1089Problem DescriptionOn Octor

2015-09-25 12:59:24 398

原创 hdu1150Machine Schedule(好题)

Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7113 Accepted Submission(s): 3564Problem DescriptionAs we all k

2015-09-24 18:55:41 555

原创 hdu1068Girls and Boys

Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9027 Accepted Submission(s): 4159Problem Descriptionthe second

2015-09-24 15:08:05 1493

转载二分图的一下小证明

其中的知识都是从别人那里复制的,知识自己进行了一下整合二分图的定义:把一个图的顶点划分为两个不相交集 U 和V ，使得每一条边都分别连接U、V中的顶点。如果存在这样的划分，则此图为一个二分图。二分图的一个等价定义是：不含有「含奇数条边的环」的图。交替路：从一个未匹配点出发，依次经过非匹配边、匹配边、非匹配边…形成的路径叫交替路。增广路：从一个未匹配点出发，走交替路，如果途径另一

2015-09-24 14:43:06 928

转载二分图最大匹配的König定理-最小点集覆盖【Matrix67】

König定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一下：假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来覆盖所有的边。比如，下面这个图中的最大匹配和最小点覆盖已分别用蓝色和红色标注。它们都等于3。

2015-09-24 13:54:41 549

原创 hdu5464Clarke and problem

问题描述克拉克是一名人格分裂患者。某一天，克拉克分裂成了一个学生，在做题。突然一道难题难到了克拉克，这道题是这样的：给你nn个数，要求选一些数（可以不选），把它们加起来，使得和恰好是pp的倍数（00也是pp的倍数），求方案数。对于nn很小的时候，克拉克是能轻易找到的。然而对于nn很大的时候，克拉克没有办法了，所以来求助于你。输入描述第一行一个整数T(1 \le T

2015-09-22 15:41:12 722

原创 hdu5442Favorite Donut(好题)

Favorite DonutTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1961 Accepted Submission(s): 482Problem DescriptionLulu has a s

2015-09-22 15:21:44 572

原创 poj3294Life Forms

Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11322 Accepted: 3135DescriptionYou may have wondered why most extraterrestrial life forms rese

2015-09-22 12:29:28 308

转载 POJ 3693 Maximum repetition substring（好题)

转自http://blog.csdn.net/acm_cxlove/article/details/7854526在后缀数组神文中也这题的题解。比较容易理解的部分就是枚举长度为L，然后看长度为L的字符串最多连续出现几次。既然长度为L的串重复出现，那么str[0],str[l],str[2*l]……中肯定有两个连续的出现在字符串中。那么就枚举连续的两个，然后从这两个字符前后匹

2015-09-21 20:33:17 353

原创 poj3415Common Substrings(好题)

Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8519 Accepted: 2812DescriptionA substring of a string T is defined as:T(i, k)=TiTi+

2015-09-21 14:46:44 451

原创 poj3261Milk Patterns(可重叠的k次最长重复子串)

Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12401 Accepted: 5490Case Time Limit: 2000MSDescriptionFarmer John has noticed that th

2015-09-21 11:29:40 363

原创 poj1743Musical Theme(不可重叠最长重复子串)

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 22324 Accepted: 7600DescriptionA musical melody is represented as a sequence of N (1<=N<=2000

2015-09-18 19:53:14 379

原创 poj2406Power Strings(DC3)

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 38455 Accepted: 15966DescriptionGiven two strings a and b we define a*b to be their concatena

2015-09-18 15:54:50 358

原创 hdu1403Longest Common Substring

Longest Common SubstringTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5144 Accepted Submission(s): 1811Problem DescriptionGiv

2015-09-18 13:25:11 506

原创 hdu1074Doing Homework(状态压缩，好题)

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6601 Accepted Submission(s): 2843Problem DescriptionIgnatius has

2015-09-17 20:42:25 318

原创 hoj2655Factory of XiaoE(状态压缩)

Factory of XiaoEBackground XiaoE创办了一个小型加工厂，可以来加工n种工件。不过加工这些工件都是原材料的。于是他找到了供应原料的大老板超级大教主（SuperDaLord -> SDL - -!）。超级大教主告诉XiaoE说，“以咱们的关系，我绝对以最低价进给你原料，然后你把做好的工件拿来，我绝对以最高价收购。不过这事不能声张，不然

2015-09-17 19:33:43 346

原创 poj2686Traveling by Stagecoach(状态压缩)

Traveling by StagecoachTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2487 Accepted: 878 Special JudgeDescriptionOnce upon a time, there was a travel

2015-09-17 14:36:09 381

原创 Codeforces Round #320 (Div. 2) C - A Problem about Polyline

C. A Problem about Polylinetime limit per test1 secondmemory limit per test256 megabytesThere is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... -

2015-09-17 13:20:58 525 2

原创 Codeforces Round #320 (Div. 2) C - A Problem about Polyline

C. A Problem about Polylinetime limit per test1 secondmemory limit per test256 megabytesThere is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... -

2015-09-17 13:20:47 394

原创 Codeforces Round #320 (Div. 2)D. "Or" Game（好题）

D. "Or" Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n numbers a1, a2, ..., an. You can perfo

2015-09-17 12:39:26 583

原创 hdu1573(中国剩余定理定解的个数)

X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4338 Accepted Submission(s): 1389Problem Description求在小于等于N的正整数中有多少个X满足：X mod

2015-09-16 20:58:59 872

原创 zoj1729最小表示法(模板题)

Hidden PasswordTime Limit: 2 Seconds Memory Limit: 65536 KB Some time the programmers have very strange ways to hide their passwords. See for example how Billy "Hacker" Geits hide his p

2015-09-16 20:11:07 461

原创 hdu5396Expression(区间dp,好题)

Expression Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/OthersProblem DescriptionTeacher Mai has n nu

2015-09-16 16:11:27 459

原创 zoj3892Available Computation Sequence(区间dp)

这是一道简单的区间dp，刚开始没看到字符数目小于等于100#include <map>#include <set>#include <stack>#include <queue>#include <cmath>#include <ctime>#include <vector>#include <cstdio>#include <cctype>#include <cstring>#

2015-09-16 12:38:50 525

原创 hdu5446Unknown Treasure

中国剩余定理的简单运用结合LUCAS定理另外就是两个数相乘他的结果可能爆long long ,所以要用快速乘法进行计算#include<bits/stdc++.h>using namespace std;typedef long long ll;ll num;ll num1[11];ll num2[11];ll fact[100005];void init(ll p){ fa

2015-09-15 15:44:31 426

原创 hdu5437Alisha’s Party

简单地优先队列模拟#include<bits/stdc++.h>using namespace std;char s[150001][210];int value[150001];char ans[150001][210];int mx;int ans1[101];int n,m,k;struct Node{ int time; int num;}open[15000

2015-09-15 11:12:43 402

原创 hdu5441Travel

并查集加离线处理#include<bits/stdc++.h>using namespace std;const int maxn=5000+10;int f[20100];int count1[maxn];int num[4*maxn];struct Edge{ int from,to,dis;}e[100100];struct node{ int num; i

2015-09-14 20:50:42 509

原创 hdu5444Elven Postman

每插入一个点就从根开始找应该要插到哪里，如果比父亲结点大插到左边，比父亲结点小插到右边,如果他的父亲结点没有左儿子(比父亲大)或者右儿子(比父亲小)，就把这个结点作为他的左儿子(比父亲大)或者右儿子(比父亲小)#include <map>#include <set>#include <stack>#include <queue>#include <cmath>#include <ctime

2015-09-14 18:16:39 458

原创 hdu5438Ponds

首先拓扑排序可以去掉度小于2的，剩下的只会是环其次注意题目说的是连通，所以可能有很多个环相连的情况,所以这时便要判断这一个连通分量里是否有奇数个点#include<bits/stdc++.h>using namespace std;typedef long long ll;const int maxn=1e4+100;vector<int>G[maxn];int vis[maxn];

2015-09-14 16:37:05 569

原创 hdu2433Xiao Ming climbing

Xiao Ming climbingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 155Problem DescriptionDue to the cu

2015-09-14 16:11:54 406

原创 hdu2433

TravelTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2163 Accepted Submission(s): 721Problem Description One day, Tom trav

2015-09-11 20:26:31 555

原创二进制的神奇应用

谜题：这是一个在坐标轴上玩的，关于“坐标集合”({a1,a2,…,am},{b1,b2,…,bl}) 的游戏。首先，Bob分别在坐标a1,a2,…,am放上一个球。接下来Bob分别在坐标b1+0.5,b2+0.5,…,bl+0.5挖了一个洞。最后Bib会将所有球往前推（往坐标变大的方向），让球滚进第一个遇到的洞里。如果有奇数个洞有最少一个球，Bob就赢得这场游戏。现在Bob想知道对于n个

2015-09-11 11:04:36 3419

原创 a(n+2)-4a(n+1)+4a(n) = 0 现在知道a(0) = x, a(10^8) = y, 求a((10^8)/2)

Problem JTime Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 18 Accepted Submission(s) : 10Font: Times New Roman | Verdana | GeorgiaFont S

2015-09-10 20:27:45 1053

原创有一个n*m的格子,求起点到终点的最小字典序

Problem A Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65535/65535K (Java/Other)Total Submission(s) : 80 Accepted Submission(s) : 15Font: Times New Roman | Verdana | GeorgiaFont

2015-09-10 16:14:14 2719

空空如也

空空如也