nudt_oys-CSDN博客

原创 POJ 3661 Running（区间DP）

RunningDescriptionThe cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can choose to either run or

2016-08-02 22:20:16 487

原创 HDOJ 3466 Proud Merchants（贪心 + 01背包）

Proud MerchantsProblem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in t

2016-08-02 22:06:21 362

原创 POJ 3280 Cheapest Palindrome（区间DP）

Cheapest PalindromeDescriptionKeeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag tha

2016-08-02 21:50:40 443

原创 CodeForces 702B Powers of Two（二分）

B. Powers of TwoYou are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i j) that ai + aj is a power of 2 (i. e. some integer xexists so that ai + aj =

2016-08-02 21:32:15 657

原创 HDOJ 4198 Quick out of the Harbour（BFS）

Quick out of the HarbourProblem DescriptionCaptain Clearbeard decided to go to the harbour for a few days so his crew could inspect and repair the ship. Now, a few days later, the pirates

2016-08-02 21:21:15 334

原创 UVaOJ 10003 Cutting Sticks（区间DP）

You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery,Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of workreq

2016-08-02 17:21:09 374

原创 CodeForces 538B Quasi Binary（简单数学）

B. Quasi BinaryA number is called quasibinary if its decimal representation contains only digits 0 or 1. For example, numbers 0, 1, 101, 110011 — are quasibinary and numbers 2, 12, 900 a

2016-08-02 16:11:55 453

原创 CSUOJ 1592 石子归并（区间DP）

1592: 石子归并Description现在有n堆石子，第i堆有ai个石子。现在要把这些石子合并成一堆，每次只能合并相邻两个，每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。Input第一行包含一个整数T（T每组数据第一行包含一个整数n（2第二行包含n个正整数ai（aiOutput每

2016-08-01 21:04:54 483 1

原创 POJ 1905 Expanding Rods（二分）

Expanding RodsDescriptionWhen a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion. When a thin rod is mounte

2016-08-01 19:47:19 312

原创 POJ 1651 Multiplication Puzzle（区间DP）

Multiplication PuzzleDescriptionThe multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and

2016-08-01 16:22:30 275

原创 HDOJ 3583 LOOPS（期望DP）

LOOPSProblem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator

2016-07-31 23:44:42 320

原创 POJ 2096 Collecting Bugs（期望DP）

Collecting BugsDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, h

2016-07-31 23:25:14 278

原创 HDOJ 4405 Aeroplane chess（期望DP）

Aeroplane chessProblem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice h

2016-07-31 23:04:12 316

原创 SGU 495 Kids and Prizes（期望DP || 数学规律）

Kids and PrizesDescriptionICPC (International Cardboard Producing Company) is in the business of producing cardboard boxes. Recently the company organized a contest for kids fo

2016-07-31 22:32:14 490

原创 POJ 1548 A strange lift（BFS）

A strange liftProblem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two bu

2016-07-30 22:27:18 276

原创 POJ 2251 Dungeon Master（三维BFS）

Dungeon MasterDescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one

2016-07-30 21:37:43 243

原创 CSUOJ 1770 按钮控制彩灯实验（树状数组 || 技巧）

1770: 按钮控制彩灯实验Description应教学安排，yy又去开心的做电学实验了。实验的内容分外的简单一串按钮通过编程了的EEPROM可以控制一串彩灯。然而选择了最low的一种一对一的控制模式，并很快按照实验指导书做完实验的yy马上感觉到十分无趣。于是他手指在一排按钮上无聊的滑来滑去，对应的彩灯也不断的变化着开关。已知每一个按钮按下会改变对应一个彩灯的状态，如此

2016-07-30 20:35:37 594

原创 HDOJ 1712 ACboy needs your help（分组背包）

ACboy needs your helpProblem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on

2016-07-29 23:52:38 333

原创 UVaOJ 580 Critical Mass（基础DP）

During the early stages of the Manhattan Project, the dangers of the new radioctive materials werenot widely known. Vast new factory cities were built to manufacture uranium and plu- tonium in bulk.Co

2016-07-29 22:35:02 455

原创 UVaOJ 12563 Jin Ge Jin Qu hao（01背包）

(If you smiled when you see the title, this problem is for you ^_^)For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_boxThere is one very popular song called Jin Ge Jin Qu().

2016-07-29 21:12:47 465

原创 POJ 2533 Longest Ordered Subsequence（基础DP）

Longest Ordered SubsequenceDescriptionA numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ...,

2016-07-29 21:04:14 210

原创 CSUOJ 1587 爬楼梯

1587: 爬楼梯Description小时候我们都玩过爬楼梯的游戏：两人猜拳，赢了可向上爬一级，谁先到最高级则获胜。作为大学生，我们应该玩一个更有水平的游戏。现在一个人要上n级楼梯，每一步可以选择上一级或者上两级，但是不能后退。求上这n级楼梯的方案数。Input第一行只有一个整数T(1下面的T行每一行有一个整数n(1

2016-07-29 20:57:14 710

原创 HDOJ 2159 FATE

FATEProblem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍耐度降到0或者0以下时，xhd就不会玩这游

2016-07-29 20:47:03 245

原创 POJ 1458 Common Subsequence

Common SubsequenceDescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequen

2016-07-28 23:59:29 246

原创 HDOJ 4864 Task（贪心）

TaskProblem DescriptionToday the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below

2016-07-28 23:10:23 473

原创 CodeForces 685A Robbers' watch

A. Robbers' watchRobbers, who attacked the Gerda's cab, are very successful in covering from the kingdom police. To make the goal of catching them even harder, they use their own watches.

2016-07-28 20:36:03 456

原创 CodeForces 621C Wet Shark and Flowers

C. Wet Shark and FlowersThere are n sharks who grow flowers for Wet Shark. They are all sitting around the table, such that sharks i and i + 1 are neighbours for all i from 1 to n - 1.

2016-07-28 20:08:42 323

原创 CodeForces 621B Wet Shark and Bishops

B. Wet Shark and BishopsToday, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom,

2016-07-28 14:28:54 345

原创 HDOJ 1597 find the nth digit

find the nth digitProblem Description假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789..

2016-07-28 08:53:42 335

原创 HDOJ 2614 Beat

BeatProblem DescriptionZty is a man that always full of enthusiasm. He wants to solve every kind of difficulty ACM problem in the world. And he has a habit that he does not like to solve

2016-07-28 08:35:53 268

原创 CodeForces 687A NP-Hard Problem

A. NP-Hard ProblemRecently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.Suppose the graph G is given. Subset

2016-07-28 08:28:55 393

原创 POJ 3278 Catch That Cow（BFS）

Catch That CowDescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and t

2016-07-27 08:44:05 252

原创 POJ 4355 Party All the Time（三分）

Party All the TimeProblem DescriptionIn the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there is one thing you

2016-07-26 23:18:31 277

原创 HDOJ 1242 Rescue（BFS + 优先队列）

RescueProblem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is:

2016-07-26 22:08:17 495

原创 POJ 1083 Moving Tables

Moving TablesDescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the

2016-07-25 23:28:00 309

原创 POJ 1426 Find The Multiple

Find The MultipleDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume

2016-07-25 17:15:12 204

原创 POJ 1979 Red and Black（DFS）

Red and BlackDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one

2016-07-25 17:05:40 252

原创 HDOJ 1241 Oil Deposits（DFS）

Oil DepositsProblem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land

2016-07-25 16:50:08 264

原创 POJ 3737 UmBasketella（三分）

UmBasketellaDescriptionIn recent days, people always design new things with multifunction. For instance, you can not only use cell phone to call your friends, but you can also use your cel

2016-07-24 21:25:23 389

原创 POJ 1035 Spell checker

Spell checkerDescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictiona

2016-07-24 21:06:37 265

空空如也

空空如也