暑假训练+个人复习
文章平均质量分 82
say_c_box
小白不能不努力~
展开
-
51NOD 1183——编辑距离(动态规划基础)
1183 编辑距离基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注编辑距离,又称Levenshtein距离(也叫做Edit Distance),是指两个字串之间,由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符,插入一个字符,删除一个字符。例如将kitten一原创 2016-07-21 09:35:52 · 525 阅读 · 0 评论 -
POJ1185——炮兵阵地(状态压缩dp)
炮兵阵地Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 25195Accepted: 9726Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也原创 2016-08-02 17:11:15 · 425 阅读 · 0 评论 -
HDU2476——String painter(区间dp)
DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a s原创 2016-08-17 16:50:21 · 536 阅读 · 0 评论 -
POJ3311——Hie with the Pie(floyd,状态压缩dp,旅行商)
Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6506 Accepted: 3514DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas t原创 2016-08-02 21:46:00 · 453 阅读 · 0 评论 -
HDU5723(2016多校第一场)——Abandoned country(最小生成树+dfs)
DescriptionAn abandoned country has n(n≤100000) villages which are numbered from 1 to n. Since abandoned for a long time, the roads need to be re-built. There are m(m≤1000000) roads to be re原创 2016-08-06 22:21:58 · 480 阅读 · 0 评论 -
SPOJ——QTREE2 - Query on a tree II(树链剖分或者倍增法)
DescriptionYou are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned to it, representing its length.W原创 2016-08-06 22:37:16 · 970 阅读 · 0 评论 -
CodeForces 615E——Hexagons(二分,模拟)
E. Hexagonstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAyrat is looking for the perfect code. He decide原创 2016-08-06 22:47:12 · 349 阅读 · 0 评论 -
POJ1741——Tree(树上分治,树的重心)
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17804 Accepted: 5818DescriptionGive a tree with n vertices,each edge has a length(positive integer原创 2016-08-06 22:50:53 · 390 阅读 · 0 评论 -
HDU5783(2016多校第五场)——Divide the Sequence(水水水)
New~ 欢迎参加2016多校联合训练的同学们~ Divide the SequenceTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 962 Accepted Submission(s): 471原创 2016-08-07 16:48:03 · 330 阅读 · 0 评论 -
HDU4283——You Are the One(区间dp)
Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so i原创 2016-08-17 15:25:16 · 398 阅读 · 1 评论 -
POJ1651——Multiplication Puzzle(区间dp)
最近刷区间dp,先写水题Multiplication PuzzleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8604 Accepted: 5375DescriptionThe multiplication puzzle is play原创 2016-08-17 13:38:15 · 368 阅读 · 0 评论 -
关于集合整数表示的一些技巧以及状态压缩dp入门(POJ3254)
当元素比较少的时候,并且和集合状态有关的问题是,就可以考虑用一个二进制的整数来表示集合。整数的每一位上,若为0则表示对应的元素不选取,若为1则表示对应的元素选取。以此为基础可以进行一些简单的集合运算。空集:0 只含有第i个元素的集合:1含有从0开始的n个元素的集合: 1判断第i个元素是否属于集合S:if(S>>i&1)向集合中加入第i个元素:S|(1向集合中删原创 2016-08-02 15:43:46 · 507 阅读 · 0 评论 -
POJ3046——Ant Counting(dp算法)
先占个坑不知道为啥一直 wa简单dp#include #include #include #include using namespace std;#define MAXN 1010#define INF 1e9+7#define MODE 1000000int t,a,s,b;int m[MAXN];long long dp[MAXN][MAXN];原创 2016-07-18 11:17:26 · 337 阅读 · 0 评论 -
POJ1509——Glass Beads(字符串的最小表示法)
Glass BeadsTime Limit: 3000MS Memory Limit: 10000KTotal Submissions: 3826 Accepted: 2163DescriptionOnce upon a time there was a famous actress. As you may expec原创 2016-07-31 21:23:31 · 400 阅读 · 0 评论 -
【转】POJ3181——Dollar Dayz(完全背包优化)
看到一篇很棒的题解,存下来。书上一直没明白的看这个题解瞬间打通任督六脉。 原博客地址:http://www.hankcs.com/program/cpp/poj-3181-dollar-dayz.html原题如下: Dollar Dayz Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6032 Acce转载 2016-07-21 11:28:20 · 666 阅读 · 0 评论 -
POJ1065——Wooden Sticks(动态规划,二分优化)
原题如下:Wooden SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21590 Accepted: 9197DescriptionThere is a pile of n wooden sticks. The length原创 2016-07-21 13:36:21 · 728 阅读 · 0 评论 -
POJ1631——Bridging signals(动态规划,最长上升子序列应用)
B - Bridging signalsTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1631Appoint description: System Crawler (Jul 15, 2016 8:10:06 AM原创 2016-07-21 14:17:03 · 560 阅读 · 0 评论 -
POJ1135——Domino Effect(最短路)
Domino EffectTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10676Accepted: 2648DescriptionDid you know that you can use domino bones for other thing原创 2016-08-04 16:37:36 · 605 阅读 · 0 评论 -
POJ3666(动态规划)
题目:C - Making the GradeTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3666Appoint description: System Crawler (Jul 21, 20原创 2016-07-21 23:26:57 · 565 阅读 · 0 评论 -
SPOJ375——Query on a tree(树链剖分模板详解以及入门)
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : cha原创 2016-08-05 10:42:56 · 2689 阅读 · 1 评论 -
HDU5791(2016多校第五场)——Two(动态规划)
TwoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1543 Accepted Submission(s): 680Problem DescriptionAlice gets two sequence原创 2016-08-07 16:52:31 · 315 阅读 · 0 评论 -
HDU5792(2016多校第五场)——World is Exploding(树状数组,离散化)
World is ExplodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 901 Accepted Submission(s): 423Problem DescriptionGiven a s原创 2016-08-07 16:57:32 · 401 阅读 · 0 评论 -
博弈论专题——推理与动态规划相关博弈之POJ2068 POJ3688动态规划)
NimTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1649 Accepted: 931DescriptionLet's play a traditional game Nim. You and I are seated across a table原创 2016-08-12 23:36:17 · 1045 阅读 · 0 评论 -
POJ2975——Nim(经典nim变种)
NimTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5556 Accepted: 2604DescriptionNim is a 2-player game featuring several piles of stones. Players a原创 2016-08-13 13:29:54 · 489 阅读 · 0 评论 -
51NOD1092—— 回文字符串(区间dp)
回文串是指aba、abba、cccbccc、aaaa这种左右对称的字符串。每个字符串都可以通过向中间添加一些字符,使之变为回文字符串。例如:abbc 添加2个字符可以变为 acbbca,也可以添加3个变为 abbcbba。方案1只需要添加2个字符,是所有方案中添加字符数量最少的。Input输入一个字符串Str,Str的长度 Output输出最少添加多原创 2016-08-13 16:03:27 · 440 阅读 · 0 评论 -
51NOD1007——整数分组(01背包)
将一堆正整数分为2组,要求2组的和相差最小。例如:1 2 3 4 5,将1 2 4分为1组,3 5分为1组,两组和相差1,是所有方案中相差最少的。Input第1行:一个数N,N为正整数的数量。第2 - N+1行,N个正整数。(N Output输出这个最小差Input示例512345Output示例1原创 2016-08-13 16:13:15 · 495 阅读 · 0 评论 -
51NOD1042——1042 数字0-9的数量(数位dp)
给出一段区间a-b,统计这个区间内0-9出现的次数。比如 10-19,1出现11次(10,11,12,13,14,15,16,17,18,19,其中11包括2个1),其余数字各出现1次。Input两个数a,b(1 Output输出共10行,分别是0-9出现的次数Input示例10 19Output示例1111111原创 2016-08-13 16:30:02 · 537 阅读 · 0 评论 -
HDU5724(多校第一场)——Chess(sg函数,状态压缩)
ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1838 Accepted Submission(s): 811Problem DescriptionAlice and Bob are pla原创 2016-08-13 22:37:26 · 381 阅读 · 0 评论 -
POJ2311——Cutting Game(sg函数)
Cutting GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3859 Accepted: 1438DescriptionUrej loves to play various types of dull games. He usually a原创 2016-08-13 22:40:46 · 591 阅读 · 0 评论 -
HDU5833(2016CCPC网赛)——Zhu and 772002(异或方程组,素数分解)
Zhu and 772002Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 510 Accepted Submission(s): 170Problem DescriptionZhu and 77200原创 2016-08-15 10:21:51 · 901 阅读 · 0 评论 -
博弈论专题——推理与动态规划相关博弈之POJ2484 POJ1740(模仿游戏)
本专题题目均来自挑战程序设计竞赛例题和练习A Funny GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5198 Accepted: 3244DescriptionAlice and Bob decide to play a fu原创 2016-08-12 23:01:36 · 582 阅读 · 0 评论 -
HDU5823(2016多校第八场)——color II (状压dp,独立集)
New~ 欢迎参加2016多校联合训练的同学们~ color IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 512 Accepted Submission(s): 205Probl原创 2016-08-12 16:33:04 · 1477 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) D——Vasiliy's Multiset(异或字典树)
D. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthor has gone out of the stories ab原创 2016-08-12 13:45:33 · 877 阅读 · 0 评论 -
HDU5781(2016多校第五场)——ATM Mechine(动态规划)
ATM MechineTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1021 Accepted Submission(s): 515Problem DescriptionAlice is going原创 2016-08-08 10:08:59 · 380 阅读 · 0 评论 -
51NOD中的矩阵取数问题(1083,1084,1411)——动态规划,插头dp
唉,dp还是不行,多加努力。1083 矩阵取数问题基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注一个N*N矩阵中有不同的正整数,经过这个格子,就能获得相应价值的奖励,从左上走到右下,只能向下向右走,求能够获得的最大价值。例如:3 * 3的方格。1 3 3原创 2016-08-08 15:37:50 · 1401 阅读 · 0 评论 -
HDU5813(多校第七场)——Elegant Construction(模拟构造)
Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 42 Accepted Submission(s): 21Special JudgeProblem Description原创 2016-08-09 17:39:19 · 635 阅读 · 0 评论 -
HDU5818(多校第七场)——Joint Stacks(优先队列,左偏树)
Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 81 Accepted Submission(s): 29Problem DescriptionA stack is a data原创 2016-08-09 17:45:54 · 564 阅读 · 0 评论 -
HDU5810(2016多校第七场)——Balls and Boxes(组合数学,概率)
Balls and BoxesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 29 Accepted Submission(s): 21Problem DescriptionMr. Chopsticks原创 2016-08-09 17:51:38 · 587 阅读 · 0 评论 -
HDU5816(2016多校第七场)——Hearthstone(暴力枚举,状态压缩)
HearthstoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 488 Accepted Submission(s): 206Problem DescriptionHearthstone is a原创 2016-08-10 13:32:08 · 894 阅读 · 0 评论 -
HDU5812(2016多校第七场)——Distance(数论,枚举)
DistanceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 304 Accepted Submission(s): 111Problem DescriptionIn number theory,原创 2016-08-10 14:26:09 · 690 阅读 · 0 评论