Vmorish

—— Anything is possible

排序:
默认
按更新时间
按访问量

HDU - 5489 Removed Interval (dp+线段树) 2015合肥网络赛

HDU - 5489 Removed Interval (dp+线段树) 2015合肥网络赛Problem Description Given a sequence of numbers A=a1,a2,…,aN, a subsequence b1,b2,…,bk of A is referred...

2017-09-13 12:55:26

阅读数:292

评论数:0

whu网络赛 E - Money

DESCRIPTION Kile and Pogi have found ​N banknotes on the street. After making sure that the original  owner is nowhere to be found, they decided t...

2017-05-14 09:58:43

阅读数:146

评论数:0

UVA_1025 A Spy in the Metro(dp)

题意:有n个车站,分别编号为1-n,没亮列车从车站i到车站i+1需要花费ti的时间(其中1 分析:典型的动态规划,用dp[i][j]表示时刻i车站j处的列车需要等待的时间,边界条件就是dp[T][n] = 0,dp[T][i] = INF,有三种决策: 1.不上车等一分钟,此时dp[i][j]...

2017-04-17 21:39:48

阅读数:116

评论数:0

HDU_1003 Max Sum

Given a sequence a11,a22,a33......ann, your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in thi...

2017-04-08 22:03:31

阅读数:443

评论数:0

HDU_1087 Super Jumping! Jumping! Jumping!

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

2017-04-08 20:45:03

阅读数:132

评论数:0

wustoj1889编辑距离

Description 设A和B是两个字符串。我们要用最少的字符操作次数,将字符串A转换为字符串B。这里所说的字符操作共有三种: 1、删除一个字符; 2、插入一个字符; 3、将一个字符改为另一个字符。 对任的两个字符串A和B,计算出将字符串A变换为字符串B所用的最少字符操作次数。...

2017-02-25 16:50:42

阅读数:326

评论数:0

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