关注
分享
文章平均质量分 80
基础：#大数运算，#结构体+sort排序，#C++stl，#GCD与LCM，#素数打表，#贪心，#快速幂，#数学，#与或运算
数论：#容斥原理，#抽屉原理，#树状数组
数据结构：#站和队列，#二分查找，#深搜广搜，#并查集，#最小生成树，#最短路径，#拓扑排序，#二分匹配，#动态规划
lu_1110
这个作者很懒，什么都没留下…
展开
-
m表示为一些不超过n的自然数之和
/*设m,n均为自然数，m可表示为一些不超过n的自然数之和，f(m,n)为这种表示方式的数目。例：f(5,3)=5，有五种表示方式：3+2，3+1+1，2+2+1，2+1+1+1，1+1+1+1+1*/#include<stdio.h>int f(int m, int n);int main(){ int m,n,ans; scanf("%d%d",...原创 2018-07-19 07:42:41 · 3365 阅读 · 2 评论 -
NYoj-311 （完全背包模板）
完全背包时间限制：3000 ms | 内存限制：65535 KB难度：4描述直接说题意，完全背包定义有N种物品和一个容量为V的背包，每种物品都有无限件可用。第i种物品的体积是c，价值是w。求解将哪些物品装入背包可使这些物品的体积总和不超过背包容量，且价值总和最大。本题要求是背包恰好装满背包时，求出最大价值总和是多少。如果不能恰好装满背包原创 2016-08-15 21:31:18 · 188 阅读 · 0 评论 -
杭电-2191 （完全背包转换01背包）
悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25338 Accepted Submission(s): 10723Problem Description原创 2016-08-15 15:45:28 · 768 阅读 · 0 评论 -
杭电-1248 寒冰王座（完全背包模板）
寒冰王座Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15148 Accepted Submission(s): 7803Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张原创 2016-08-15 12:18:08 · 397 阅读 · 0 评论 -
杭电-1171 Big Event in HDU（完全背包转换01背包）
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36109 Accepted Submission(s): 12537Problem DescriptionNowadays原创 2016-08-15 11:54:18 · 188 阅读 · 0 评论 -
杭电-2602 Bone Collector（01背包模板）
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51853 Accepted Submission(s): 21833Problem DescriptionMany years原创 2016-08-15 11:21:50 · 228 阅读 · 0 评论 -
NYOJ 860 又见01背包（01背包理解运用）
又见01背包时间限制：1000 ms | 内存限制：65535 KB难度：3描述 有n个重量和价值分别为wi 和 vi 的 物品，从这些物品中选择总重量不超过 W的物品，求所有挑选方案中物品价值总和的最大值。 1 1 1 1 输入多组测试数据。每组测试数据第一行输入，n 和 W ，接下来有原创 2016-08-11 18:25:22 · 243 阅读 · 0 评论 -
杭电-1203 I NEED A OFFER!（01背包）
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24882 Accepted Submission(s): 10055Problem DescriptionSpeakles原创 2016-08-11 17:31:54 · 544 阅读 · 0 评论 -
01背包&完全背包&多重背包 - 区别
参考：http://blog.csdn.net/niushuai666/article/details/6654872 01背包问题 这是最基本的背包问题，每个物品最多只能放一次题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。原创 2016-08-11 16:43:15 · 770 阅读 · 0 评论 -
NYOJ-325 zb的生日（01背包模板）
zb的生日时间限制：3000 ms | 内存限制：65535 KB难度：2描述今天是阴历七月初五，acm队员zb的生日。zb正在和C小加、never在武汉集训。他想给这两位兄弟买点什么庆祝生日，经过调查，zb发现C小加和never都很喜欢吃西瓜，而且一吃就是一堆的那种，zb立刻下定决心买了一堆西瓜。当他准备把西瓜送给C小加和never的时候，遇到原创 2016-08-11 16:23:26 · 292 阅读 · 0 评论 -
杭电-1159 Common Subsequence（最长公共子序列）
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34214 Accepted Submission(s): 15596Problem DescriptionA sub原创 2016-08-12 11:36:23 · 579 阅读 · 0 评论 -
HDU-1257 最少拦截系统(LIS)
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34514 Accepted Submission(s): 13603Problem Description某国为了防御敌国的导弹袭击原创 2016-08-11 09:48:42 · 279 阅读 · 0 评论 -
LightOJ 1047 Neighbor House （DP 数字三角形变形）
DescriptionThe people of Mohammadpur have decided to paint each of their houses red, green, or blue. They've also decided that no two neighboring houses will be painted the same color. The neigh原创 2016-09-10 00:39:04 · 377 阅读 · 0 评论 -
杭电-2059 龟兔赛跑 （基础DP）
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16356 Accepted Submission(s): 6161Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的原创 2016-08-24 09:11:09 · 340 阅读 · 0 评论 -
杭电-1466 计算直线的交点数
计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9521 Accepted Submission(s): 4327Problem Description平面上有n条直线，且无三线共点，问这些原创 2016-08-10 10:03:38 · 282 阅读 · 0 评论 -
杭电-1559 最大子矩阵
最大子矩阵Time Limit: 30000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4180 Accepted Submission(s): 2183Problem Description给你一个m×n的整数矩阵，在上面找一个x×y原创 2016-08-10 09:20:10 · 315 阅读 · 0 评论 -
POJ-1745 Divisibility
DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11509 Accepted: 4124DescriptionConsider an arbitrary sequence of integers. One can place + o原创 2016-08-09 20:09:06 · 179 阅读 · 0 评论 -
杭电-1176 免费馅饼
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41808 Accepted Submission(s): 14360Problem Description都说天上不会掉馅饼，但有一天gameb原创 2016-08-09 18:01:02 · 594 阅读 · 0 评论 -
杭电-1260 Tickets
TicketsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3251 Accepted Submission(s): 1608Problem DescriptionJesus, what a great mo原创 2016-08-08 20:15:52 · 239 阅读 · 0 评论 -
杭电-1231 最大连续子序列
最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28157 Accepted Submission(s): 12780Problem Description给定K个整数的序列{ N1, N2,原创 2016-08-08 20:11:35 · 309 阅读 · 0 评论 -
杭电-1003 Max Sum
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 217222 Accepted Submission(s): 51237Problem DescriptionGiven a sequenc原创 2016-08-08 20:06:41 · 431 阅读 · 0 评论 -
杭电-2084 数塔
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36579 Accepted Submission(s): 21904Problem Description在讲述DP算法的时候，一个经典的例子就是数原创 2016-08-08 20:03:01 · 425 阅读 · 0 评论 -
二分图匹配—匈牙利算法
本文转载地址： http://blog.csdn.net/q3498233/article/details/5786225二分图：二分图是这样一个图，它的顶点可以分类两个集合X和Y，所有的边关联的两个顶点恰好一个属于集合X，另一个属于集合Y。二分图匹配：给定一个二分图G，在G的一个子图M中，M的边集中的任意两条边都不依附于同一个顶点，则称M是一个匹配。最大匹配：图中包含边数转载 2016-08-20 19:51:29 · 289 阅读 · 0 评论 -
杭电-1498 50 years, 50 colors（二分匹配）
50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2309 Accepted Submission(s): 1299Problem DescriptionOn Octorbe原创 2016-08-18 20:20:10 · 324 阅读 · 0 评论 -
杭电-1179 魔法师与魔法棒（二分匹配模板）
Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1503 Accepted Submission(s): 833P原创 2016-08-17 17:12:44 · 272 阅读 · 0 评论 -
杭电-2063 过山车
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11503 Accepted Submission(s): 5062Problem DescriptionRPG girls今天和大家一起去原创 2016-08-17 09:42:30 · 298 阅读 · 0 评论 -
杭电-5695 Gym Class（拓扑排序）
Gym ClassTime Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1160 Accepted Submission(s): 481Problem Description众所周知，度度熊喜欢各类体育活动。原创 2016-08-18 10:11:35 · 341 阅读 · 0 评论 -
杭电-4857 逃生（拓扑排序+优先队列）
逃生Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4297 Accepted Submission(s): 1208Problem Description糟糕的事情发生啦，现在大家都忙着逃命。但是逃命原创 2016-08-05 21:32:21 · 273 阅读 · 0 评论 -
杭电-2641 Reward（拓扑排序）
RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7528 Accepted Submission(s): 2377Problem DescriptionDandelion's uncle is原创 2016-08-05 21:26:32 · 263 阅读 · 0 评论 -
杭电-1285 确定比赛名次（模板）
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22362 Accepted Submission(s): 9043Problem Description有N个比赛队（1 Inp原创 2016-08-05 11:49:47 · 257 阅读 · 0 评论 -
杭电-1317 XYZZY（最短路+正向环）
XYZZYTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1701 Accepted Submission(s): 419Problem DescriptionIt has recently been原创 2016-08-19 09:52:57 · 364 阅读 · 0 评论 -
杭电-1599 find the mincost route（最小环有向图）
find the mincost routeTime Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4164 Accepted Submission(s): 1673Problem Description杭州有原创 2016-08-16 21:10:18 · 351 阅读 · 0 评论 -
杭电-2553-Frogger（最短路径）
Language:DefaultFroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37624 Accepted: 12117DescriptionFreddy Frog is sitting on a stone in the mi原创 2016-08-16 20:16:45 · 265 阅读 · 0 评论 -
杭电-2112 HDU Today（dijkstra）
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25333 Accepted Submission(s): 6125Problem Description经过锦囊相助，海东集团终于度过了原创 2016-08-05 10:38:44 · 250 阅读 · 0 评论 -
杭电-5137How Many Maos Does the Guanxi Worth（删点枚举+最短路）
How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1947 Accepted Submission(s): 751Problem Desc原创 2016-08-04 20:56:59 · 230 阅读 · 0 评论 -
杭电-3665 Seaside (判断后找最短路)
SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1373 Accepted Submission(s): 988Problem DescriptionXiaoY is living i原创 2016-08-04 20:50:39 · 236 阅读 · 0 评论 -
杭电-2066 一个人的旅行（Floyd&&dijkstra）
一个人的旅行Time Limit: 1000/1000 MS (Java/Others ) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31806 Accepted Submission(s): 10941Problem Description虽然草儿是个路痴（就是在杭电待了原创 2016-08-04 19:47:21 · 365 阅读 · 0 评论 -
杭电-1596 find the safest road（Floyd&&dijkstra）
find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11573 Accepted Submission(s): 4081Problem DescriptionXX星球有原创 2016-08-04 18:06:28 · 267 阅读 · 0 评论 -
杭电-1874 畅通工程续 (Floyd&&dijkstra)
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45897 Accepted Submission(s): 17062Problem Description某省自从实行了很多年的畅通工程计划后原创 2016-08-04 16:24:54 · 327 阅读 · 0 评论 -
杭电-1869 六度分离（Floyd&&dijkstra）
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7814 Accepted Submission(s): 3195Problem Description1967年，美国著名的社会学家斯坦利·米尔格兰姆提原创 2016-08-04 15:12:06 · 235 阅读 · 0 评论