Beyond the Sora

拖延症晚期

hdu1083——Courses(匈牙利算法)

Problem Description Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine ...

2016-09-28 20:00:39

阅读数:542

评论数:0

hdu2444——The Accomodation of Students(判断二分图+匈牙利算法)

Problem Description There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and...

2016-09-28 19:12:25

阅读数:565

评论数:0

hdu1045——Fire Net(二分图+行列匹配)

Problem Description Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each repr...

2016-09-28 18:38:05

阅读数:583

评论数:0

hihoCoder1385——A Simple Job(模拟)

描述 Institute of Computational Linguistics (ICL), Peking University is an interdisciplinary institute of science and liberal arts, it focuses primari...

2016-09-26 21:23:40

阅读数:326

评论数:0

Lightoj1205——Palindromic Numbers(数位dp+回文数)

A palindromic number or numeral palindrome is a ‘symmetrical’ number like 16461 that remains the same when its digits are reversed. In this problem y...

2016-09-26 19:27:31

阅读数:1571

评论数:0

Lightoj1068——Investigation(数位dp)

An integer is divisible by 3 if the sum of its digits is also divisible by 3. For example, 3702 is divisible by 3 and 12 (3+7+0+2) is also divisible ...

2016-09-23 21:53:52

阅读数:576

评论数:0

poj3252——Round Numbers(数位dp)

DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone’ (also known as ‘Rock, Paper, Scissors...

2016-09-23 21:00:24

阅读数:834

评论数:0

Lightoj1032——Fast Bit Calculations(数位dp)

A bit is a binary digit, taking a logical value of either 1 or 0 (also referred to as “true” or “false” respectively). And every decimal number has a...

2016-09-23 20:15:39

阅读数:554

评论数:0

Lightoj1140——How Many Zeroes?(数位dp)

Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down?Input...

2016-09-23 18:38:59

阅读数:216

评论数:0

hdu3709——Balanced Number(数位dp)

Problem Description A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine ...

2016-09-23 18:13:02

阅读数:208

评论数:0

hdu3652——B-number(数位dp变形)

Problem Description A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string “13” and can be divid...

2016-09-21 21:03:02

阅读数:197

评论数:0

hdu3555——Bomb(数位dp)

Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence...

2016-09-21 20:48:17

阅读数:452

评论数:0

hdu2089——不要62(数位dp)

Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。 不吉利的数字为所有含有4或62...

2016-09-21 19:45:41

阅读数:355

评论数:0

hdu4027——Can you answer these queries?(线段树+区间更新变形)

Problem Description A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to elimina...

2016-09-16 19:12:05

阅读数:636

评论数:0

poj3264——Balanced Lineup(线段树+区间最大值与最小值)

DescriptionFor the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a g...

2016-09-14 20:07:55

阅读数:897

评论数:0

poj2828——Buy Tickets(线段树+倒插法)

DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year...

2016-09-14 19:25:30

阅读数:730

评论数:0

poj1195——Mobile phones(二维树状数组)

DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. Th...

2016-09-13 20:32:40

阅读数:740

评论数:0

hdu1698——Just a Hook(线段树+区间更新)

Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of severa...

2016-09-12 21:07:01

阅读数:655

评论数:0

hdu2795——Billboard(线段树+区间最大值)

Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The b...

2016-09-12 19:46:41

阅读数:566

评论数:0

Lightoj1082——Array Queries(线段树+求区间最小值)

Given an array with N elements, indexed from 1 to N. Now you will be given some queries in the form I J, your task is to find the minimum value from ...

2016-09-12 12:31:42

阅读数:541

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭