Amove

原来已经走出这么远

POJ-1050-To the Max(DP)

To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 51817 Accepted: 27379DescriptionGiven a two-dimensional array of positive and neg...

2018-05-31 01:26:35

阅读数:30

评论数:0

Codeforces987C 、Three displays (DP)

C. Three displays time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output It is the mid...

2018-05-30 13:02:06

阅读数:100

评论数:0

POJ 2431-Expedition (优先队列+贪心)

ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21498 Accepted: 6137DescriptionA group of cows grabbed a truck and ventured on an...

2018-05-26 16:38:41

阅读数:46

评论数:0

POJ-1182 食物链(带权并查集)

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 86400 Accepted: 25862Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以...

2018-05-25 00:55:18

阅读数:91

评论数:0

HDU-2444 The Accomodation of Students(二分图匹配+判断)

The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8233    Accepted ...

2018-05-23 22:18:15

阅读数:39

评论数:0

HDU 1069-Monkey and Banana(DP)

Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18602    Accepted Submission...

2018-05-21 20:43:26

阅读数:40

评论数:0

Codeforces982 D. Shark(STL)

D. Shark time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output For long time scientis...

2018-05-20 23:55:15

阅读数:115

评论数:0

Codeforces982B. Bus of Characters(STL+贪心)

B. Bus of Characters time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output In the Bu...

2018-05-18 02:52:00

阅读数:143

评论数:0

Codeforces982C、Cut 'em all!(DFS)

C. Cut 'em all! time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You're given a ...

2018-05-18 02:41:16

阅读数:223

评论数:0

hdu-2571命运(DP)

命运Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22034    Accepted Submission(s): 7627Proble...

2018-05-17 22:27:19

阅读数:17

评论数:0

Codeforces984D 、XOR-pyramid(DP)

D. XOR-pyramid time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output For an array bb...

2018-05-16 22:02:33

阅读数:88

评论数:0

HDU -1087 Super Jumping! Jumping! Jumping!(DP)

一、原题地址传送门二、题意    求最大上升子序列和三、代码#include<iostream> #include<cstdio> #include<cstdlib>...

2018-05-15 19:07:07

阅读数:20

评论数:0

Codeforces979C 、 Kuro and Walking Route(dfs)

C. Kuro and Walking Route time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Kuro...

2018-05-15 15:12:18

阅读数:285

评论数:0

Codeforces979B、Treasure Hunt(模拟)

B. Treasure Hunt time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output After the big ...

2018-05-15 13:42:42

阅读数:86

评论数:0

Codeforces978G Petya's Exams(贪心+模拟)

G. Petya's Exams time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Petya studies ...

2018-05-14 21:43:44

阅读数:518

评论数:0

Codeforces978F. Mentors(二分)

F. Mentors time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output In BerSoft nn progr...

2018-05-14 19:21:59

阅读数:272

评论数:1

Codeforces978D. Almost Arithmetic Progression (暴力)

D. Almost Arithmetic Progression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output...

2018-05-13 22:34:00

阅读数:247

评论数:1

CodeForces - 148E Porcelain (dp)

一、原题地址传送门二、大致题意    给出一个有n层的架子,可以从中取出m个东西。每层有k个东西,每次可以从最左或者最右取出物品,然后给出的是k个物品的价值。三、思路    首先处理出每层取j个物品时能获得的最大价值,记作work[i][j]。    然后变成了背包问题。四、代码#include&...

2018-05-12 16:09:45

阅读数:16

评论数:0

codeforces 977F Consecutive Subsequence (dp)

一、原题地址传送门二、大致题意    求最大连续上升子序列。三、思路    一维的dp,记录一下当前数在数组前有没有出现过比它小1的数。四、代码#include<iostream> #include<cstdio&g...

2018-05-08 15:36:00

阅读数:59

评论数:0

codeforces 977D Divide by three, multiply by two(DFS)

一、原题地址传送门二、大致题意    给出n个数,有两种操作。1、a[i]这个数能被3整除成为a[i+1]。2、a[i]×2=a[i+1].三、思路 裸的dfs.四、代码#include<iostream> #include<cst...

2018-05-07 07:20:48

阅读数:90

评论数:0

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