算法
文章平均质量分 80
LZRHINO
这个作者很懒,什么都没留下…
展开
-
POJ-3070 Fibonacci (矩阵快速幂)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17928 Accepted: 12470DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, t...原创 2018-04-25 13:39:23 · 258 阅读 · 0 评论 -
ACM矩阵相关模板;
矩阵快速幂: 因为结构体已经重载了 * 所以只需在原来普通的快速幂模板的基础上稍微修改一下。其他操作主要是模拟。#define _rep(i, a, b) for(int i = a; i <= b; i++)#define _for(i, a, b) for(int i = a; i < b; i++)#define M_sel *thisusing namespace ...原创 2018-04-25 13:34:46 · 464 阅读 · 0 评论 -
POJ-2182 Lost Cows
Language:DefaultLost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12330 Accepted: 7925DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular ...原创 2018-03-27 14:20:15 · 192 阅读 · 0 评论 -
POJ - 3278 Catch That Cow (搜索)
Language:DefaultCatch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 102978 Accepted: 32162DescriptionFarmer John has been informed of原创 2018-01-20 10:34:18 · 220 阅读 · 0 评论 -
POJ-2251 Dungeon Master (搜索)
DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one un原创 2018-01-20 09:33:01 · 212 阅读 · 0 评论 -
POJ-2186 (强连通分量)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37824 Accepted: 15398DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 1...原创 2018-05-04 18:22:29 · 273 阅读 · 0 评论 -
(最短路)POJ - 2387 :Til the Cows Come Home
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61545 Accepted: 20880DescriptionBessie is out in the field and wants to get back原创 2018-01-04 22:48:02 · 657 阅读 · 0 评论 -
优化整理
sort 排序优化#define _for(i,a,b) for(int i = (a); i < (b); i++)#define N 1000000struct Node{ int a,b,c;};struct cmp{ inline bool operator() (const Node& t1, const Node& t2){ if(t1.a !...原创 2018-03-10 23:14:42 · 222 阅读 · 0 评论 -
ACM 模板整理
一 .图论:最短路:1. Dijkstra 算法:/*用优先队列优化,vector存储边,输入方式: while (~scanf("%d%d", &m, &n) && m) { for (int i = 0; i < m; i++) { scanf("%d%d%d", &a, &b, &c); G[a].push_b...原创 2018-01-04 22:38:54 · 394 阅读 · 0 评论 -
HDU-1230 I NEED A OFFER! (完全背包)
Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了原创 2017-07-27 07:28:56 · 266 阅读 · 0 评论 -
HDU-1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28615 Accepted Submission(s): 11613Problem DescriptionSpeakles原创 2017-07-07 00:37:32 · 389 阅读 · 0 评论 -
HDU-2602
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 62187 Accepted Submission(s): 25918Problem DescriptionMany year原创 2017-07-07 00:36:22 · 382 阅读 · 0 评论 -
HDU-1421
搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28404 Accepted Submission(s): 9750Problem Description搬寝室是很累的,xhd深有体会.时间追述2原创 2017-07-07 00:26:58 · 254 阅读 · 0 评论 -
HDU-1160
FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16432 Accepted Submission(s): 7264Special JudgeProblem Descriptio原创 2017-07-07 00:19:30 · 294 阅读 · 0 评论 -
HDU-1231&HDU-1003
最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32827Accepted Submission(s): 14770Problem Description给定K个整数的序列{ N1, N...原创 2017-07-07 00:12:08 · 287 阅读 · 0 评论 -
HDU-1159
Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e原创 2017-07-07 00:10:10 · 306 阅读 · 0 评论 -
HDU-1176
Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中原创 2017-07-07 00:00:15 · 378 阅读 · 0 评论 -
HDU-1087
Problem DescriptionNowadays, 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 game, so I introduce it to原创 2017-07-06 23:43:26 · 250 阅读 · 0 评论 -
HDU-2084
Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1原创 2017-07-06 23:10:23 · 270 阅读 · 0 评论