2011年04月_HQD因为有趣所以做题

原创 hdu 2732 / poj 2711 Leapin' Lizards //拆点最大流

Leapin' LizardsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1166 Accepted: 447DescriptionYour platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of t

2011-04-29 19:47:00 1776

原创 hdu 1569 方格取数(2)//最小割

#include<cstdio>#include<cstring>const int MAXN=10010;const int MAXM=100000;const int INF = 0x7fffffff;struct Edge{ int st, ed,next,flow;} edge[MAXM];int head[MAXN],value[MAXN];int N, M, F, E;int src, dest;int seq

2011-04-28 20:32:00 791

原创 poj 1625 Censored!//AC自动机+DP+大数

Censored!Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 3608 Accepted: 999DescriptionThe alphabet of Freeland consists of exactly N letters. Each sentence of Freeland language (also known as Freish) consists of exactly M letters without word br

2011-04-28 19:31:00 1617 1

原创 hust 1024 dance party

dance partyTime Limit: 2 Sec Memory Limit: 128 MB Submissions: 324 Solved: 112 Description You are organizing a dance party. The party will be attended by n boys and n girls. There will be several rounds of dancing. In each rou

2011-04-27 20:27:00 1054

原创 hdu 3046 Pleasant sheep and big big wolf //最小割

/*这么大的图，差点不敢水。。。。还是用最小割水了，建图很简单，知道最小割的估计都会，不累赘了*/#include<cstdio>#include<cstring>const int N=50000;const int M=500000;const int inf=0x7fffffff;int head[N];int map[201][201];struct Edge{ int v,next,w;} edge[M];int cnt,n,s,t

2011-04-27 20:13:00 1447 1

原创 hdu 2243 考研路茫茫——单词情结 //AC自动机

考研路茫茫——单词情结Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 520 Accepted Submission(s): 143 #include<cstdio>#include<cstring>typedef unsigned __int64 ul

2011-04-26 21:05:00 1543

原创差距

今天是个人赛最后一场，由于模板和自己最后AC自动机的侥幸，终于在这一系列的比赛中排到榜首。 我很清楚自己的实力，只能说是和孔牛，秦牛旗鼓相当，却的确不分胜负甚至是比不上这两牛。个人赛的侥幸，只是偶尔获胜，在不同算法方面，我们各自都有各自的专攻。 今天我依然在思考自己和师哥的差距，最大体现在哪。 以前可以说我知道的算法不够多，所以太水了。 现在看来最大的差距并不是在这。 我的算法，我一直在一块块补。 但是今天我更加，我的思维

2011-04-24 21:19:00 1158

原创 poj 2778 DNA Sequence //AC自动机+矩阵乘法

DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5080 Accepted: 1766DescriptionIt's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA Sequence，For example, if a ani

2011-04-22 21:59:00 1408

原创 hdu 3065 病毒侵袭持续中 //AC自动机

病毒侵袭持续中Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 866 Accepted Submission(s): 293 Problem Description小t非常感谢大家帮忙解决了他的上一个问题。然而病毒侵袭持续中。在小t的不懈努力下，他发现了网路中的“万恶之源”

2011-04-21 19:26:00 882

原创 hdu 2896 病毒侵袭 //AC自动机

病毒侵袭Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1621 Accepted Submission(s): 423 Problem Description当太阳的光辉逐渐被月亮遮蔽，世界失去了光明，大地迎来最黑暗的时刻。。。。在这样的时刻，人们却异常兴奋——我们能在有

2011-04-21 18:09:00 1578

原创 hdu 2222 Keywords Search //ac自动机

Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7476 Accepted Submission(s): 2541 Problem DescriptionIn the modern time, Search engine came into the life

2011-04-21 09:05:00 1159

原创 poj 3294 Life Forms

Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4628 Accepted: 1207 Description You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles

2011-04-19 15:22:00 1550

原创 poj 3415 Common Substrings

Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 3112 Accepted: 1002 Description A substring of a string T is defined as: T(i, k)=TiTi+1...Ti+k-1, 1≤i≤i+k-1≤|T|. Given two strings A, B and one i

2011-04-18 21:09:00 1204 1

原创 poj 3693 Maximum repetition substring //后缀数组

Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2233 Accepted: 547 Description The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same co

2011-04-16 09:30:00 1483

原创 spoj 687 Repeats//后缀数组

SPOJ Problem Set (classical)687. RepeatsProblem code: REPEATSA string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the strings = abaabaabaabais a (4,3)-repeat with t = aba as its

2011-04-15 21:42:00 1422

原创 timus 1517 Freedom of Choice//后缀数组

1517. Freedom of ChoiceTime Limit: 2.0 second Memory Limit: 32 MBBackgroundBefore Albanian people could bear with the freedom of speech (this story is fully described in the problem "Freedom of speech"), another freedom - the freedom of choice -

2011-04-15 19:35:00 1081

原创 poj 2406 Power Strings //DC3 后缀数组

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 16624 Accepted: 6923 DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think o

2011-04-15 08:51:00 979

原创 timus 1297 Palindrome//后缀数组，求最长公共回文字

1297. PalindromeTime Limit: 1.0 second Memory Limit: 16 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Unlimited» has infiltrated into “U.S. Robotics”. «U.S

2011-04-14 21:07:00 723

原创 poj 3368 Frequent values //RMQ

Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7310 Accepted: 2617 Description You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries

2011-04-14 20:27:00 650

原创 poj 3368 Frequent values //线段树

Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7308 Accepted: 2615 Description You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries

2011-04-14 20:09:00 780

原创 3264 Balanced Lineup //rmq

Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16743 Accepted: 7758Case Time Limit: 2000MS Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer J

2011-04-14 18:51:00 505

原创 poj 2411 Mondriaan's Dream

Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5755 Accepted: 3308 DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where

2011-04-14 09:08:00 718

原创 spoj694 Distinct Substrings

SPOJ Problem Set (classical)694. Distinct SubstringsProblem code: DISUBSTR Given a string, we need to find the total number of its distinct substrings.Input T- number of test cases. T<=20; Each test case consists of one string,

2011-04-13 20:32:00 824

原创 poj 3261 Milk Patterns

Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4698 Accepted: 2012Case Time Limit: 2000MS Description Farmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigatio

2011-04-13 20:11:00 1636

原创 poj 1743 Musical Theme

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7517 Accepted: 2656 DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the pian

2011-04-13 19:52:00 1466

原创 joj2730 stock

/*很大的教训最小路径覆盖首先是每个点拆点的问题接着这个题目对于某一行来说，只需要找到比它大的行就可以了，不要既找到比它小的，又找到比它大的，这样会导致重复连边思考，对于每个点，只要找到比它大的，用一条路径覆盖，就是从小到大，这样就可以了*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int usedif[110];int l

2011-04-08 08:35:00 507

原创 poj 2954

TriangleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2866 Accepted: 1218 Description A lattice point is an ordered pair (x, y) where x and y are both integers. Given the coordinates of the vertices of a triangle (which

2011-04-07 18:52:00 884

原创 joj 1173

1173: Circle More AlikeResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K661258Standard 1st Jilin University ACM International Collegiate Programming Contest In this problem, you are to write a program to calculate the roundness of

2011-04-06 21:27:00 552

原创 poj 2242

The Circumference of the CircleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4952 Accepted: 3269 DescriptionTo calculate the circumference of a circle seems to be an easy task - provided you know its diameter. But what if you don't?

2011-04-06 21:09:00 910

原创 poj 1410

IntersectionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5892 Accepted: 1484 DescriptionYou are to write a program that has to decide whether a given line segment intersects a given rectangle. An example: line:

2011-04-06 20:13:00 1335 1

原创 ZOJ 2587 最小割的唯一性

Unique AttackTime Limit: 5 Seconds Memory Limit: 32768 KB N supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pairs of supercomputers are connected t

2011-04-03 20:36:00 933

hqd_acm的专栏