2016年10月_mrcoderrev

原创 HDU 1561 The more, The Better（树形DP入门）

The more, The BetterTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡

2016-10-30 21:09:14 167

原创 HDU 1947 Rebuilding Roads（树形DP）

Rebuilding RoadsTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe cows have reconstructed Farmer John's farm, with its N barns (

2016-10-30 19:42:51 163

原创 hdu 1520 Anniversary party(树形DP）

Anniversary partyTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is going to be a party to celebrate the 80-th Anniversary

2016-10-30 15:37:28 178

原创 hdu 5945 Fxx and game(单调队列OR标记过程的bfs)@

Fxx and gameTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 486 Accepted Submission(s): 120Problem DescriptionYoung theoreti

2016-10-30 12:51:48 560

原创 HDU 2063 Investment（多次完全背包）

InvestmentTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionJohn never knew he had a grand-uncle, until he received the notary's let

2016-10-26 21:51:03 526

原创 HDU 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活(多重背包转01背包）

悼念512汶川大地震遇难同胞――珍惜现在，感恩生活Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription急！灾区的食物依然短缺！为了挽救灾区同胞的生命，心系灾区同胞的你准备自己采购一些粮食支援灾区，现在假设你

2016-10-26 21:50:56 277

原创 HDU 1114（多重背包）

多重Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBefore ACM can do anything, a budget must be prepared and the necessary fina

2016-10-26 21:50:38 281

原创 HDU 1059（多重）

DividingTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMarsha and Bill own a collection of marbles. They want to split the co

2016-10-26 21:50:20 252

原创 poj 1276 Cash Machine(多重背包求最大容量）

Cash MachineTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA Bank plans to install a machine for cash withdrawal. The machine is

2016-10-26 21:50:05 242

原创 hihocoder 1385 A Simple Job(STL）

#1385 : A Simple Job时间限制:1000ms单点时限:1000ms内存限制:256MB描述Institute of Computational Linguistics (ICL), Peking University is an interdisciplinary institute of science and lib

2016-10-26 21:49:40 333

原创 uva147 Dollars（完全背包方案）

DollarsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 147 uDebugAppoint description: System Crawler (Sep 21, 2016 8:33:48 PM)De

2016-10-26 21:49:25 414

原创 POJ 3260 The Fewest Coins（多重背包+完全背包—>交易数量最小）@

The Fewest CoinsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFarmer John has gone to town to buy some farm supplies. Being a

2016-10-26 21:49:07 472

原创 poj 1787 Charlie's Change(打印路径的多重背包 ->交易数量最大化）

Charlie's ChangeTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit Status Practice _Appoint description: System Crawler (Sep 19, 2016 8:51:38 PM)De

2016-10-26 21:48:44 333

原创 hdu 2126 Buy the souvenirs(01背包求最大容量方法数）

Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2102 Accepted Submission(s): 795Problem DescriptionWhen the

2016-10-26 21:48:27 288

原创 uva 674（完全背包求方法数）@

Description#include #include #include #include #include using namespace std;const int N = 100000;int k[N], dp[N];int main(){ int v[]={1,5,10,25,50}; int n;

2016-10-26 21:48:10 303

原创 HDU 3466 Proud Merchants（排序的01背包）@

Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5525 Accepted Submission(s): 2327Problem DescriptionRecently,

2016-10-26 21:47:56 555

原创 hdu 2955 Robberies(01背包）

RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21042 Accepted Submission(s): 7805Problem DescriptionThe aspiring Ro

2016-10-26 21:47:45 249

原创 hdu 2639 Bone Collector II(01背包的第k值）

Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4226 Accepted Submission(s): 2202Problem DescriptionThe titl

2016-10-26 21:47:28 221

原创 UVA 624 CD(打印路径的01背包）

Root 624 - CDTime limit: 3.000 seconds类似于搜索中的打印路径，用一个数组标记，，，不好想#include #include #include #include #include using namespace std;const int N = 1000;

2016-10-26 21:47:22 259

原创 hdu 2546 (01背包）

饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23721 Accepted Submission(s): 8339Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即

2016-10-26 21:47:05 197

原创 light oj 1005 - Rooks (组合数学）

1005 - Rooks PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBA rook is a piece used in the game of chess which is play

2016-10-26 21:46:51 291

原创 POJ - 2184 Cow Exhibition（变种01背包...)

Cow ExhibitionTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescription"Fat and docile, big and dumb, they look so stupid, t

2016-10-26 21:46:34 382

转载 40个Java多线程问题总结

前言Java多线程分类中写了21篇多线程的文章，21篇文章的内容很多，个人认为，学习，内容越多、越杂的知识，越需要进行深刻的总结，这样才能记忆深刻，将知识变成自己的。这篇文章主要是对多线程的问题进行总结的，因此罗列了40个多线程的问题。这些多线程的问题，有些来源于各大网站、有些来源于自己的思考。可能有些问题网上有、可能有些问题对应的答案也有、也可能有些各位网友也都看过，但是本文写作的重心就

2016-10-26 21:46:22 253

原创 hdu ztr loves lucky numbers (暴搜）

ztr loves lucky numbersTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionztr loves lucky numbers. Everybody knows that positive

2016-10-26 21:45:33 351

原创 hdu 5898 odd-even number(基础数位DP）

odd-even numberTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFor a number,if the length of continuous odd digits is even and

2016-10-26 13:12:27 278

原创 POJ - 2392 Space Elevator(多重背包）

Space ElevatorTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThe cows are going to space! They plan to achieve orb

2016-10-25 19:45:56 243

原创 POJ 3666 Making the Grade(DP 推导）

Making the GradeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6416 Accepted: 2983DescriptionA straight dirt road connects two fields on FJ's farm, but

2016-10-25 19:45:45 166

原创 POJ - 1065 Wooden Sticks(DP 子序列问题）

Wooden SticksTime Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThere is a pile of n wooden sticks. The length and wei

2016-10-25 19:45:26 299

原创 POJ - 3046 Ant Counting（多重集组合数DP）

Ant CountingTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionBessie was poking around the ant hill one day watching

2016-10-25 19:45:15 376

原创 POJ - 3181 Dollar Dayz（多重背包）

Dollar DayzTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionFarmer John goes to Dollar Days at The Cow Store and dis

2016-10-25 19:44:56 213

原创 POJ - 1742 Coins（多重背包）@

CoinsTime Limit: 3000MS Memory Limit: 30000KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionPeople in Silverland use coins.They have coins of value A1,A2,

2016-10-25 19:44:39 260

原创 POJ - 3280 Cheapest Palindrome(DP)

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionKeeping track of all the cows can be a tricky

2016-10-25 19:44:21 204

原创 POJ - 3616 Milking Time(Dp)

Milking TimeTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionBessie is such a hard-working cow. In fact, she is so

2016-10-25 19:44:04 186

原创 POJ - 2385 Apple Catching （DP）

Apple CatchingTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionIt is a little known fact that cows love apples. Farm

2016-10-25 19:43:53 179

原创 light oj 1211 - Intersection of Cubes (计算几何）

1211 - Intersection of Cubes PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBYou are given n cubes, each cube is des

2016-10-25 19:43:41 323

原创 light oj 1202 - Bishops(规律推导）

1202 - Bishops PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBThere is an Infinite chessboard. Two bishops are th

2016-10-25 19:43:29 365

原创 POJ 3159 Candies（差分约束系统）

CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 29348 Accepted: 8128DescriptionDuring the kindergarten days, flymouse was the monitor of his c

2016-10-25 19:43:17 202

原创 POJ 3067 Japan(树状数组+逆序数）

JapanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26287 Accepted: 7138DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads

2016-10-25 19:43:02 238

转载差分约束系统详解

一直不知道差分约束是什么类型题目，最近在写最短路问题就顺带看了下，原来就是给出一些形如x-y好神奇的是这类问题竟然可以转换成图论里的最短路径问题，下面开始详细介绍下比如给出三个不等式,b-a由题我们可以得知，这个有向图中，由题b-a根据以上的解法，我们可能会猜到求解过程实际就是求从a到c的最短路径，没错的....简单的说就是从a到c沿着某条路径后把所有权值和

2016-10-25 19:42:52 638

原创 HDU 1394 Minimum Inversion Number（树状数组+逆序数）

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18380 Accepted Submission(s): 11159Problem Description

2016-10-25 19:42:37 246

空空如也

空空如也