H3CNE-H3CTE学习历程第53页

AndyQsmart ACM学习历程——ZOJ3872 Beauty of Array（递推）

Description Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the beauty of a

·2015-11-12 11:17

AndyQsmart ACM学习历程——ZOJ3870 Team Formation（位运算）

Description For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his university. Edward knows the skill level of each stude

·2015-11-12 11:17

ACM学习历程——HDU3333 Turing Tree（线段树 && 离线操作）

Problem Description After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of

·2015-11-12 11:16

ACM学习历程——HDU2227 Find the nondecreasing subsequences（线段树 && dp）

Description How many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, ...., sn} ? For example, we assume that S = {1, 2, 3}, and you can find seven nondecreasing subsequences

·2015-11-12 11:15

ACM学习历程——POJ3321 Apple Tree（搜索，线段树）

Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturi

·2015-11-12 11:15

ACM学习历程——NOJ1113 Game I（贪心 || 线段树）

Description 尼克发明了这样一个游戏：在一个坐标轴上，有一些圆，这些圆的圆心都在x轴上，现在给定一个x轴上的点，保证该点没有在这些圆内(以及圆上)，尼克可以以这个点为圆心做任意大小的圆，他想知道自己做多可以与多少个给定的圆相交(相切也算,包含不算)。 Input 输入有多组数据输入到文件尾每一组数据有一个整数n(1<=n<=100000)，表示总

·2015-11-12 11:14

ACM学习历程——HDU5202 Rikka with string（dfs，回文字符串）

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: One day, Yuta got a string which

·2015-11-12 11:13

ACM学习历程——hihoCoder挑战赛10A 01串（策略）

时间限制: 7000ms 单点时限: 1000ms 内存限制: 256MB 描述给定两个整数n和m，求是否存在恰好包含n个0和m个1的01串S，使得S中不存在子串"001"和"11"。如果存在符合条件的01串则输出字典序最小的S，否则输出NO。输入一行两个整数，表示n和m。(0<=n,m<=100000,0<n+m

·2015-11-12 11:12

ACM学习历程——POJ3468 A Simple Problem with Integers（线段树）

Description You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is t

·2015-11-12 11:12

ACM学习历程——POJ1260 Pearls（动态规划）

Description In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal

·2015-11-12 11:11

ACM学习历程——UVA540 Team Queue（队列，map：Hash）

Description Team Queue Team Queue Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is no

·2015-11-12 11:10

ACM学习历程——UVA10112 Myacm Triangles（计算几何，多边形与点的包含关系）

Description Problem B: Myacm Triangles Problem B: Myacm Triangles Source file: triangle.{c, cpp, java, pas} Input file: triangle.in Output file: triangle.out There

·2015-11-12 11:10

ACM学习历程——UVA11111 Generalized Matrioshkas（栈）

Description Problem B - Generalized Matrioshkas Problem B - Generalized Matrioshkas Vladimir worked for years making matrioshkas, those nesting dolls that c

·2015-11-12 11:09

ACM学习历程——UVA11234 Expressions（栈，队列，树的遍历，后序遍历，bfs）

Description Problem E: Expressions 2007/2008 ACM International Collegiate Programming Contest University of Ulm Local Contest Problem E: Expressions Arithmetic expressions are

·2015-11-12 11:08

ACM学习历程——UVA442 Matrix Chain Multiplication（栈）

Description Matrix Chain Multiplication Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrice

·2015-11-12 11:07

ACM学习历程——HDU5137 How Many Maos Does the Guanxi Worth（14广州10题）（单源最短路）

Problem Description "Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also

·2015-11-12 11:07

ACM学习历程——UVA127 "Accordian" Patience（栈，链表）

Description ``Accordian'' Patience You are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows: Deal cards one by one in a

·2015-11-12 11:06

ACM学习历程——POJ 2376 Cleaning Shifts（贪心）

Description Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has div

·2015-11-12 11:05

ACM学习历程——POJ 1700 Crossing River（贪心）

Description A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the b

·2015-11-12 11:05

ACM学习历程——HDU1331 Function Run Fun（锻炼多维dp的打表）

Description We all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a <

·2015-11-12 11:04

ACM学习历程—HDU2222 Keywords Search（字典树）

Keywords Search Description In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this feature t

·2015-11-12 11:03

ACM学习历程——POJ3295 Tautology（搜索，二叉树）

Description WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any s

·2015-11-12 11:03

ACM学习历程—HDU1392 Surround the Trees（计算几何）

Description There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal required length of the rope. However, he does not know

·2015-11-12 11:02

ACM学习历程—HDU4956 Poor Hanamichi（模拟）

Poor Hanamichi Problem Description Hanamichi is taking part in a programming contest, and he is assigned to solve a special problem as follow: Given a range [l, r] (including l and r), find out how

·2015-11-12 11:01

ACM学习历程——HDU 5014 Number Sequence （贪心）（2014西安网赛）

Description There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules: ● a i ∈ [0,n] ● a i ≠ a j( i ≠ j

·2015-11-12 11:00

ACM学习历程—HDU1028 Ignatius and the Princess（组合数学）

Ignatius and the Princess Description "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 s

·2015-11-12 11:00

ACM学习历程——HDU4814 Golden Radio Base（数学递推）（12年成都区域赛）

Description Golden ratio base (GRB) is a non-integer positional numeral system that uses the golden ratio (the irrational number (1+√5)/2 ≈ 1.61803399 symbolized by the Greek letter φ) as its base.

·2015-11-12 11:59

ACM学习历程——HDU5015 233 Matrix（矩阵快速幂）（2014陕西网赛）

Description In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called

·2015-11-12 11:58

ACM学习历程——HDU5017 Ellipsoid（模拟退火）（2014西安网赛K题）

---恢复内容开始--- Description Given a 3-dimension ellipsoid(椭球面) your task is to find the minimal distance between the original point (0,0,0) and points on the ellipsoid. The distance betwe

·2015-11-12 11:57

ACM学习历程——HDU4472 Count（数学递推）（12年长春区域赛）

Description Prof. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics. This site contains r

·2015-11-12 11:57

ACM学习历程——ZOJ 3822 Domination （2014牡丹江区域赛 D题）（概率，数学递推）

Description Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What's more, he bought a large decorative chessboard with N rows and

·2015-11-12 11:56

ACM学习历程——ZOJ 3829 Known Notation （2014牡丹江区域赛K题）（策略，栈）

Description Do you know reverse Polish notation (RPN)? It is a known notation in the area of mathematics and computer science. It is also known as postfix notation since every operator in an express

·2015-11-12 11:55

ACM学习历程——UVA 127 "Accordian" Patience（栈;模拟）

Description ``Accordian'' Patience You are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows: Deal cards one by one in a

·2015-11-12 11:54

ACM学习历程—HDU4969 Just a Joke（物理题）

Just a Joke Description Here is just a joke, and do not take it too seriously. Guizeyanhua is the president of ACMM, and people call him President Guizeyanhua. When Guizeyanhua is walking

·2015-11-12 11:54

ACM学习历程—FZU2148 Moon Game（计算几何）

Moon Game Description Fat brother and Maze are playing a kind of special (hentai) game in the clearly blue sky which we can just consider as a kind of two-dimensional plane. Then Fat brother starts

·2015-11-12 11:53

ACM学习历程—HDU 5012 Dice（ACM西安网赛）（bfs）

Problem DescriptionThere are 2 special dices on the table. On each face of the dice, a distinct number was written. Consider a1.a2,a3,a4,a5,a6 to be numbers written on top face, bottom face, left face

·2015-11-12 11:52

ACM学习历程—Rotate（HDU 2014 Anshan网赛）（几何）

Problem DescriptionNoting is more interesting than rotation!Your little sister likes to rotate things. To put it easier to analyze, your sister makes n rotations. In the i-th time, she makes everythin

·2015-11-12 11:52

ACM学习历程—HDU 5025 Saving Tang Monk（广州赛区网赛）（bfs）

Problem Description 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dynasty. In this novel, Mon

·2015-11-12 11:51

ACM学习历程—HDU 5023 A Corrupt Mayor's Performance Art（广州赛区网赛）（线段树）

Problem DescriptionCorrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this se

·2015-11-12 11:50

我的EJB学习历程

http://blog.csdn.net/sinapaper/archive/2004/06/28/28659.aspx http://blog.csdn.net/sinapaper/archive/2004/06/29/29634.aspx http://blog.csdn.net/sinapaper/archive/2004/06/30/30538.aspx http://blog.cs

·2015-11-12 10:07

ACM学习历程—Hihocoder 1177 顺子(模拟 && 排序 && gcd)（hihoCoder挑战赛12）

时间限制:6000ms 单点时限:1000ms 内存限制:256MB 描述你在赌场里玩梭哈，已经被发了4张牌，现在你想要知道发下一张牌后你得到顺子的概率是多少？假定赌场使用的是一副牌，四种花色的A、2、3、...、J、Q、K共52张，这副牌只发给你了4张，你的剩下一张牌从剩下48张中任意取出一张。顺子指的是点数连续的五张牌，包括10、J、

·2015-11-11 18:53

ACM学习历程—HDU5269 ZYB loves Xor I(位运算 && dfs && 排序)（BestCoder Round #44 1002题）

Problem Description Memphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(Ai xor Aj) (i,j∈[1,n]) We define that lowbit(x)=2^k,k is the s

·2015-11-11 18:52

ACM学习历程—HDU5265 pog loves szh II（策略 && 贪心 && 排序）

Description Pog and Szh are playing games.There is a sequence with $n$ numbers, Pog will choose a number A from the sequence. Szh will choose an another number named B from the rest in the sequence.

·2015-11-11 18:51

ACM学习历程—SNNUOJ 1116 A Simple Problem（递推 && 逆元 && 组合数学 && 快速幂）（2015陕西省大学生程序设计竞赛K题）

Description Assuming a finite – radius “ball” which is on an N dimension is cut with a “knife” of N-1 dimension. How many pieces will the “ball” be cut into most?However, it’s impossible to understan

·2015-11-11 18:51

ACM学习历程—FZU 2144 Shooting Game（计算几何 && 贪心 && 排序）

Description Fat brother and Maze are playing a kind of special (hentai) game in the playground. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.) But as they don’t like using

·2015-11-11 18:50

ACM学习历程—HDU 4726 Kia's Calculation（贪心&&计数排序）

DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number when the sum of two digits exceeds 9. For example, when she c

·2015-11-11 18:49

ACM学习历程—FZU 2140 Forever 0.5（计算几何 && 构造）

Description Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following conditions: 1. The distance between any two points is no

·2015-11-11 18:48

ACM学习历程—HDU4717 The Moving Points（模拟退火 || 三分法）

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