ACM_基础
StanleyClinton
一个川大的弱弱的ACMER,加油整起走。
展开
-
解题报告 之 POJ1226 Substrings
POJ1226 Substrings,字符串,暴力,最长公共子串You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings.原创 2015-06-01 18:06:40 · 1066 阅读 · 0 评论 -
解题报告 之 CodeForces 581C Developing Skills
Petya loves computer games. Finally a game that he's been waiting for so long came out!The main character of this game has n different skills, each of which is characterized by an integer ai from 0 to 100. The higher the number ai is, the higher is the i-原创 2015-09-28 23:38:56 · 923 阅读 · 0 评论 -
解题报告 之 ZOJ 3827 Information Entropy
解题报告 之 ZOJ 3827 Information EntropyDescriptionInformation Theory is one of the most popular courses in Marjar University. In this course, there is an important chapter about informatio原创 2015-09-30 00:44:27 · 556 阅读 · 0 评论 -
解题报告 之 CodeForces 581D Three Logos
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.Advertisers will put up the ad only if it is possible to place all three logos on the bi原创 2015-09-29 00:25:14 · 1109 阅读 · 1 评论 -
解题报告 之 HDU5305 Friends
爆搜,剪枝解题报告 之 HDU5305 FriendsDescriptionThere are people and pairs of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (mostly using face-to-face communication). H原创 2015-08-23 01:55:58 · 914 阅读 · 0 评论 -
解题报告 之 HDU5303 Delicious Apples
Description 思维,好题,枚举,离散化There are $n$ apple trees planted along a cyclic road, which is $L$ metres long. Your storehouse is built at position $0$ on that cyclic road. The $i$th tree is planted at position $x_i$, clockwise from position $0$. There are $a原创 2015-08-23 00:57:56 · 1268 阅读 · 0 评论 -
解题报告 之 HDU5301 Buildings
解题报告 之 HDU5301 BuildingsDescriptionYour current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in the shape of a rectangle. Each built wal原创 2015-08-19 00:22:07 · 1222 阅读 · 0 评论 -
解题报告 之 HDU5336 XYZ and Drops
DescriptionXYZ is playing an interesting game called "drops". It is played on a grid. Each grid cell is either empty, or occupied by a waterdrop. Each waterdrop has a property "size". The waterdrop cracks when its size is larger than 4, and produces 4 sm原创 2015-08-28 10:03:05 · 1016 阅读 · 0 评论 -
解题报告 之 HDU5335 Walk Out
bfs,多校,HDU5335In an maze, the right-bottom corner is the exit (position is the exit). In every position of this maze, there is either a or a written on it. An explorer gets lost in this grid. His position now is , and he wants to go to the exit. Sin原创 2015-08-27 16:02:07 · 1038 阅读 · 0 评论 -
解题报告 之 HDU5326 Work
HDU5326 图论基础It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title, everyone except the boss has a direct leader, and all the relat原创 2015-08-27 13:58:01 · 882 阅读 · 0 评论 -
解题报告 之 HDU5325 Crazy Bobo
解题报告 之 HDU5325 Crazy Bobo 深搜,图论,HDU5325DescriptionBobo has a tree,whose vertices are conveniently labeled by 1,2,...,n.Each node has a weight . All the weights are distrinct. A set with m nodes is a Bobo Set if: - The subgraph of his tree induced by原创 2015-08-27 13:49:29 · 983 阅读 · 0 评论 -
解题报告 之 HDU5327 Olympiad
You are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digitals are different (i.e. 12345 is beautiful, 11 is not beautiful and 100 is not b原创 2015-08-27 14:06:45 · 673 阅读 · 0 评论 -
解题报告 之 HDU5288 OO' s Sequence
解题报告 之 HDU5288 OO' s Sequence原创 2015-08-13 14:26:16 · 891 阅读 · 0 评论 -
解题报告 之 HDU5328 Problem Killer
You are a "Problem Killer", you want to solve many problems. Now you have problems, the -th problem's difficulty is represented by an integer (). For some strange reason, you must choose some integer and (), and solve the problems between the -th and原创 2015-08-27 14:21:11 · 1114 阅读 · 0 评论 -
解题报告 之 HDU5323 Solve this interesting problem
Description 搜索,dfs,线段树逆推,剪枝。Have you learned something about segment tree? If not, don’t worry, I will explain it for you. Segment Tree is a kind of binary tree, it can be defined as this: - For each node u in Segment Tree, u has two values: and . - I原创 2015-08-24 00:42:52 · 1204 阅读 · 0 评论 -
解题报告 之 HDU5319 Painter
DescriptionMr. Hdu is an painter, as we all know, painters need ideas to innovate , one day, he got stuck in rut and the ideas dry up, he took out a drawing board and began to draw casually. Imagine the board is a rectangle, consists of several square gri原创 2015-08-24 00:45:14 · 1547 阅读 · 0 评论 -
解题报告 之 ZOJ3861 Valid Pattern Lock
ZOJ3861 ,Valid Pattern Lock,搜索,dfs,ACM原创 2015-05-18 20:54:31 · 603 阅读 · 0 评论 -
解题报告 之 ZOJ 3829 Known Notation
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 expression follows all of its operands. Bob is a student in Marjar University原创 2015-10-01 11:40:46 · 825 阅读 · 0 评论