Asimple

分类

LeetCode(2) 未归档(188)

/ 注册

全部文章（共190篇）

初涉数论

题目描述对于给定的 x , 求出使得 x^y%mod = 1 的最小正整数y ，其中 mod = 790660457 . 输入多组输入(最多50000组 ) 每组一个x ( 0 < x < mod ) ...

数论

2017-01-05

0 519

DP专题训练之HDU 1087 Super Jumping!

Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and ...

DP

2016-12-29

0 468

DP专题训练之HDU 1506 Largest Rectangle in a Histogram

Description A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths b...

DP

2016-12-29

0 556

DP专题训练之HDU 1231 最大连续子序列

Description 给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj }，其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个，例...

DP

2016-12-28

0 491

DP专题训练之HDU 1864 最大报销额

做DP一定要注意数组的大小，嗯，就是这样~ Description 现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给...

DP

2016-12-28

0 584

DP专题训练之HDU 2955 Robberies

打算专题训练下DP，做一道帖一道吧~~现在的代码风格完全变了~~大概是懒了。所以。将就着看吧~哈哈 Description The aspiring Roy the Robber has seen a lot of American movies, and know...

DP

2016-12-27

0 553

图论相关之匈牙利算法

这个本来应该是在大一就掌握的算法，硬生生被我拖到现在。。。　匈牙利算法是用来求二分图的最大匹配的一种比较简单的算法，最核心的东西就是找增广路径。详情：http://blog.csdn.net/acdreamers/article/details/8621130 　　记住一些常见的结论： ...

图匈牙利算法

2016-12-21

0 659

HDU 1072 Nightmare

Description Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignati...

BFS

2016-12-14

0 457

Tempter of the Bone

Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake,...

DFS 剪枝

2016-12-13

0 572

Curling 2.0

Description On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from our...

DFS 回溯

2016-12-08

0 658