regional 第19页

HDU 4735 Little Wish~ lyrical step~（DLX搜索）（2013 ACM/ICPC Asia Regional Chengdu Online）

Description N children are living in a tree with exactly N nodes, on each node there lies either a boy or a girl. A girl is said to be protected, if the distance between the girl and her near

·2015-11-13 02:33

HDU 4744 Starloop System（最小费用最大流）（2013 ACM/ICPC Asia Regional Hangzhou Online）

Description At the end of the 200013 th year of the Galaxy era, the war between Carbon-based lives and Silicon civilization finally comes to its end with the Civil Union born from the ru

·2015-11-13 02:31

HDU 4745 Two Rabbits（最长回文子序列）（2013 ACM/ICPC Asia Regional Hangzhou Online）

Description Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the ground and they were ar

·2015-11-13 02:31

HDU 4747 Mex（线段树）（2013 ACM/ICPC Asia Regional Hangzhou Online）

Problem Description Mex is a function on a set of integers, which is universally used for impartial game theorem. For a non-negative integer set S, mex(S) is defined as the least non-negative intege

·2015-11-13 02:30

HDU 4717 The Moving Points（三分法）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description There are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And

·2015-11-13 02:28

HDU 4719 Oh My Holy FFF（DP+线段树）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description N soldiers from the famous "*FFF* army" is standing in a line, from left to right. o o o o o o o o o o o o o o o o o o /F\ /F\ /F\ /F

·2015-11-13 02:27

HDU 4725 The Shortest Path in Nya Graph（最短路径）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this pa

·2015-11-13 02:26

HDU 4722 Good Numbers（位数DP）（2013 ACM/ICPC Asia Regional Online ―― Warmup2）

Description If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required to count the number of good numbers in the

·2015-11-13 02:26

HDU 4714 Tree2cycle（树状DP）（2013 ACM/ICPC Asia Regional Online ―― Warmup）

Description A tree with N nodes and N-1 edges is given. To connect or disconnect one edge, we need 1 unit of cost respectively. The nodes are labeled from 1 to N. Your job is to transform the tree t

·2015-11-13 02:25

HDU 3698 Let the light guide us（DP+线段树）（2010 Asia Fuzhou Regional Contest）

Description Plain of despair was once an ancient battlefield where those brave spirits had rested in peace for thousands of years. Actually no one dare step into this sacred land until the rumor tha

·2015-11-13 02:24

HDU 3689 Infinite monkey theorem（DP+trie+自动机）（2010 Asia Hangzhou Regional Contest）

Description Could you imaging a monkey writing computer programs? Surely monkeys are smart among animals. But their limited intelligence is no match for our human beings. However, there is a theorem

·2015-11-13 02:24

HDU 3697 Selecting courses（贪心+暴力）（2010 Asia Fuzhou Regional Contest）

Description A new Semester is coming and students are troubling for selecting courses. Students select their course on the web course system. There are n courses, the ith cou

·2015-11-13 02:23

HDU 3699 A hard Aoshu Problem（暴力枚举）（2010 Asia Fuzhou Regional Contest）

Description Math Olympiad is called “Aoshu” in China. Aoshu is very popular in elementary schools. Nowadays, Aoshu is getting more and more difficult. Here is a classic Aoshu problem: ABBDE __ ABC

·2015-11-13 02:22

HDU 3696 Farm Game（拓扑+DP）（2010 Asia Fuzhou Regional Contest）

Description “Farm Game” is one of the most popular games in online community. In the community each player has a virtual farm. The farmer can decide to plant some kinds of crops like wheat or paddy,

·2015-11-13 02:21

2013 ACM/ICPC Asia Regional Online —— Warmup2

HDU 4716 A Computer Graphics Problem 水题。略 HDU 4717 The Moving Points 题目：给出n个点的起始位置以及速度矢量，问任意一个时刻使得最远的两点的距离最小。分析：显然只有两点的话，答案满足三分性质。对于多个点，画个图分析一下，其实也满足三分性质。因此，先构造n*(n-

·2015-11-13 00:25

HDU 4465 - Candy（概率与数学优化）

2012成都Regional的B题，花了一个小时推出了式子，但是搞了好久发现都控制不了精度，后来突然想到组合数可以用log优化，改了之后就AC了比较水的概率题 #include &

·2015-11-13 00:07

2010年福州赛区regional 解题报告

仅有8个题的解题报告，如果大牛您看不到想看的题解，抱歉了…… 模拟比赛的时候队伍做出了6个题，其中一个水题没看懂……囧…… A题，不会……现场赛只有sjtu3个队已经bupt的一个队伍过了…… B题无向图最小割，论文题，模板题类型代码如下 B #include <cmath>#include <cstdio>#include <memory.h&

·2015-11-13 00:27

这种简单的斜率都写不明白了Harbin regional hdu3669

我的假期基本残废了= =！尼玛做管理员太累了……自己的训练基本停滞了……提高太少了，我的梦想还能实现吗…… 贴的代码完事吧 HDU 3669 1 #include <iostream> 2 #include <cstring> 3 #include <cstdio> 4 #include <algorithm> 5 using name

·2015-11-13 00:26

HDU 3269 P2P File Sharing System（模拟）（2009 Asia Ningbo Regional Contest）

Problem Description Peer-to-peer(P2P) computing technology has been widely used on the Internet to exchange data. A lot of P2P file sharing systems exist and gain much popularity in nowadays. Let

·2015-11-13 00:50

HDU 4468 Spy（KMP+贪心）（2012 Asia Chengdu Regional Contest）

Description “Be subtle! Be subtle! And use your spies for every kind of business. ” ― Sun Tzu “A spy with insufficient ability really sucks” ― An anonymous general who lost the war You, a genera

·2015-11-13 00:50

HDU 4467 Graph（图论+暴力）（2012 Asia Chengdu Regional Contest）

Description P. T. Tigris is a student currently studying graph theory. One day, when he was studying hard, GS appeared around the corner shyly and came up with a problem: Given a graph with n

·2015-11-13 00:49

HDU 3260/POJ 3827 Facer is learning to swim（DP+搜索）（2009 Asia Ningbo Regional）

Description Facer is addicted to a game called "Tidy is learning to swim". But he finds it too easy. So he develops a new game called "Facer is learning to swim" which is more di

·2015-11-13 00:45

HDU 3265/POJ 3832 Posters（扫描线+线段树）（2009 Asia Ningbo Regional）

Description Ted has a new house with a huge window. In this big summer, Ted decides to decorate the window with some posters to prevent the glare outside. All things that Ted can find are rectangle

·2015-11-13 00:44

HDU 3264/POJ 3831 Open-air shopping malls（计算几何+二分）（2009 Asia Ningbo Regional）

Description The city of M is a famous shopping city and its open-air shopping malls are extremely attractive. During the tourist seasons, thousands of people crowded into these shopping malls and en

·2015-11-13 00:44

HDU 3262/POJ 3829 Seat taking up is tough（模拟+搜索）（2009 Asia Ningbo Regional）

Description Students often have problems taking up seats. When two students want the same seat, a quarrel will probably begin. It will have very bad effect when such subjects occur on the B

·2015-11-13 00:43

HDU 3268/POJ 3835 Columbus’s bargain（最短路径+暴力枚举）（2009 Asia Ningbo Regional）

Description On the evening of 3 August 1492, Christopher Columbus departed from Palos de la Frontera with a few ships, starting a serious of voyages of finding a new route to India. As you know, jus

·2015-11-13 00:42

HDU 2494/POJ 3930 Elevator（模拟）（2008 Asia Regional Beijing）

Description Too worrying about the house price bubble, poor Mike sold his house and rent an apartment in a 50-floor building several months ago. This building has only one elevator because it is a s

·2015-11-13 00:41

HDU 2492 Ping pong（数学+树状数组）（2008 Asia Regional Beijing）

Description N(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill rank, the

·2015-11-13 00:41

HDU 2490 Parade（DPの单调队列）（2008 Asia Regional Beijing）

Description Panagola, The Lord of city F likes to parade very much. He always inspects his city in his car and enjoys the welcome of his citizens. City F has a regular road system. It looks like a m

·2015-11-13 00:40

HDU 2491 Priest John's Busiest Day（贪心）（2008 Asia Regional Beijing）

Description John is the only priest in his town. October 26th is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forev

·2015-11-13 00:39

HDU 2489 Minimal Ratio Tree（暴力+最小生成树）（2008 Asia Regional Beijing）

Description For a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation. Given a complete graph of n nodes with all nodes and edges

·2015-11-13 00:38

HDU 2487 Ugly Windows（暴力）（2008 Asia Regional Beijing）

Description Sheryl works for a software company in the country of Brada. Her job is to develop a Windows operating system. People in Brada are incredibly conservative. They even never use g

·2015-11-13 00:38

HDU 3726 Graph and Queries（平衡二叉树）（2010 Asia Tianjin Regional Contest）

Description You are given an undirected graph with N vertexes and M edges. Every vertex in this graph has an integer value assigned to it at the beginning. You're also given a sequence of operations

·2015-11-13 00:16

HDU 4115 Eliminate the Conflict（2-SAT）（2011 Asia ChengDu Regional Contest）

Problem Description Conflicts are everywhere in the world, from the young to the elderly, from families to countries. Conflicts cause quarrels, fights or even wars. How wonderful the world will be i

·2015-11-13 00:05

hdu 4738 (双联通求桥)

2013 ACM/ICPC Asia Regional Hangzhou Online 题目大意：有n个岛，曹操在一些岛之间建了一些桥，每个桥上有一些士兵把守，周瑜只有一个炸弹只能炸掉一个桥，炸弹需要士兵

·2015-11-12 23:50

2012 Asia Tianjin Regional Contest - str2int

煎熬的一个晚上。最后还是忍着，A了这题。似乎已经完全没有动力了。I’velostalmosteverything.回到这题来吧实际上就是要统计所有不同的字符串子串的和。建一个SAM，每两个字符串之间插个间隔符，拓扑排序完从root顺着每条边往下走统计答案。注意一开始不能走前导零。时间复杂度是线性的。#include usingnamespacestd; #definerep(i,a,b)for(i

GEOTCBRL·2015-11-12 22:00

2013 ACM/ICPC Asia Regional Changsha Online - G（DP）

第一眼就想到DP，然后想了N久就想不到可以不重算的DP 最后没办法了先算出来再去重。。因为最多只有三个对于三个来说有三种组合情况 x+y+z， x*y*z， x*y+z 那要么 x,y,z都不同要么有两个相同要么有三个相同对都不同情况我的DP结果会重复两次对于有两个相同的会重复一次统计出都相同的两个相同的最后减掉。。有点乱不过A了先预处理时

·2015-11-12 21:35

2013 ACM/ICPC Asia Regional Changsha Online - E

第一个被板刷的题取余依次算在周几 1 #include <iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<stdlib.h> 6 #include<cmath>

·2015-11-12 21:34

hdu chengdu 2011 regional D题

比赛时1个小时也没有写出来，在这题上卡了大跟头…… 算法三进制DP，用SPFA转移。我的做法是把初始状态（1个扔到队列里）然后转移。注意转移的时候要枚举子集。代码如下: HDU 4114 typedef long long LL;const int N = 50;const int INF = 100000000;const int K = 8;int dist[N][N];int

·2015-11-12 21:51

HDU 5002 Tree（动态树LCT）（2014 ACM/ICPC Asia Regional Anshan Online）

Problem Description You are given a tree with N nodes which are numbered by integers 1..N. Each node is associated with an integer as the weight. Your task is to deal with M operations of 4 types

·2015-11-12 21:30

HDU 5029 Relief grain（离线+线段树+启发式合并）（2014 ACM/ICPC Asia Regional Guangzhou Online）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5029 Problem Description The soil is cracking up because of the drought and the rabbit kingdom is facing a serious famine. The RRC(Rabbit Red Cross) o

·2015-11-12 21:30

ZOJ 3545 Rescue the Rabbit（AC自动机+状压DP）（The 2011 ACM-ICPC Asia Dalian Regional Contest）

Dr. X is a biologist, who likes rabbits very much and can do everything for them. 2012 is coming, and Dr. X wants to take some rabbits to Noah's Ark, or there are no rabbits any more. A rabbit's gene

·2015-11-12 21:29

HDU 4069 Squiggly Sudoku（DLX）（The 36th ACM/ICPC Asia Regional Fuzhou Site —— Online Contest）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4069 Problem Description Today we play a squiggly sudoku, The objective is to fill a 9*9 grid with digits so that each column, each row, and ea

·2015-11-12 21:28

HDU 5000 Clone（离散数学+DP）（2014 ACM/ICPC Asia Regional Anshan Online）

Problem Description After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that this power was not as perfect a