编程算法
文章平均质量分 77
牧马人Eikko
这个作者很懒,什么都没留下…
展开
-
简单二分法模板
#include<iostream>#include<string>#include<cstring>using namespace std;int a[100];int k(int m){ int r,i,n; r=99;i=0; while(r-i>=1) { n=(r+i)/2;//找到中间的元素 a数组可以sort一边...原创 2016-07-29 09:18:48 · 1069 阅读 · 0 评论 -
poj——3255Roadblocks(优先队列 求最小次最短路径)
RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12152 Accepted: 4293DescriptionBessie has moved to a small farm and sometimes enjoys returning原创 2016-08-09 06:42:52 · 295 阅读 · 0 评论 -
poj——3169Layout(差分约束 求第一只牛到第n只牛最大距离)
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10087 Accepted: 4853DescriptionLike everyone else, cows like to stand close to their friends when原创 2016-08-09 06:40:24 · 351 阅读 · 0 评论 -
poj——1064Cable master(二分搜索 求绳子可以满足的最大长度)
Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37908 Accepted: 8059DescriptionInhabitants of the Wonderland have decided to hold a regional原创 2016-08-09 06:35:29 · 467 阅读 · 0 评论 -
poj——2456Aggressive cows(二分搜索 求牛牛之间最大距离)
Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11212 Accepted: 5502DescriptionFarmer John has built a new long barn, with N (2 His C原创 2016-08-09 06:33:19 · 302 阅读 · 0 评论 -
poj——3061Subsequence(尺取法 求最小数量满足S)
SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12317 Accepted: 5171DescriptionA sequence of N positive integers (10 < N < 100 000), each of原创 2016-08-09 06:29:32 · 189 阅读 · 0 评论 -
poj——3320Jessica's Reading Problem(尺取法 求最小看书页数)
Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10574 Accepted: 3533DescriptionJessica's a very lovely girl wooed by lots of bo原创 2016-08-09 06:26:58 · 473 阅读 · 0 评论 -
hdu 4565So Easy!(巧妙的矩阵快速幂)
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3849 Accepted Submission(s): 1266Problem Description A sequence Sn is de原创 2016-09-09 14:39:32 · 404 阅读 · 0 评论 -
hdu 1575Tr A(最基本的矩阵快速幂)
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4418 Accepted Submission(s): 3319Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上原创 2016-09-09 14:36:11 · 629 阅读 · 0 评论 -
poj-3617Best Cow Line(将字符串逆序排列 与原字符串作比较)
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19090 Accepted: 5294DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual原创 2016-08-17 06:39:42 · 363 阅读 · 0 评论 -
hdu——1233还是畅通工程(并查集 求最小路径长度 减枝)
??????Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39902 Accepted Submission(s): 18125Problem Description?????????????????原创 2016-08-01 13:25:04 · 362 阅读 · 0 评论 -
hdu-2141Can you find it?(二分搜索求和)
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 24425 Accepted Submission(s): 6186Problem DescriptionGive yo原创 2016-08-16 07:51:02 · 220 阅读 · 0 评论 -
hdu-2102A计划(两层地图 bfs或者dfs)
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17611 Accepted Submission(s): 4437Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们原创 2016-08-16 07:45:48 · 375 阅读 · 0 评论 -
hdu-1728逃离迷宫(dfs 求拐弯次数)
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23021 Accepted Submission(s): 5644Problem Description 给定一个m × n (m行, n列)原创 2016-08-16 07:41:25 · 402 阅读 · 0 评论 -
poj-3253Fence Repair(优先对列 求木棍的最小和)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 39668 Accepted: 12924DescriptionFarmer John wants to repair a small length of the fence arou原创 2016-07-31 12:54:19 · 281 阅读 · 0 评论 -
hdu-1016Prime Ring Problem(素数环 dfs)
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41672 Accepted Submission(s): 18445Problem Description原创 2016-07-13 00:25:47 · 486 阅读 · 0 评论 -
poj-2431Expedition(加油站 优先队列)
ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12633 Accepted: 3605DescriptionA group of cows grabbed a truck and ventured on an expedition d原创 2016-07-30 16:27:59 · 464 阅读 · 0 评论 -
hdu-1018Big Number(阶乘求位数)
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34744 Accepted Submission(s): 16479Problem DescriptionIn ma原创 2016-07-29 17:50:31 · 648 阅读 · 0 评论 -
poj——1182食物链(并查集 每种动物扮演三种角色)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 63596 Accepted: 18671Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都原创 2016-08-09 06:45:34 · 4404 阅读 · 1 评论 -
hdu-1715大菲波数(数组表示大数)
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17637 Accepted Submission(s): 5906Problem DescriptionFibonacci数列,定义如下:f原创 2016-08-09 06:49:10 · 555 阅读 · 0 评论 -
strstr函数和find函数的异同
strstr函数和find函数都可以查找子字符串的出现位置 但是又有所不想同 #include<string.h>#include <stdlib.h>#include <conio.h>#include<stdio.h> #include<iostream>using namespace st...原创 2016-05-05 22:37:30 · 1975 阅读 · 0 评论 -
zoj-1004Anagrams by Stack(栈和向量)
Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TR原创 2017-07-21 20:02:00 · 319 阅读 · 0 评论 -
zoj-1094Matrix Chain Multiplication(栈来实现矩阵相乘)
Matrix Chain MultiplicationTime Limit: 2 Seconds Memory Limit: 65536 KB Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an ex原创 2017-07-21 20:08:26 · 366 阅读 · 0 评论 -
hdu-1394Minimum Inversion Number(暴力解法或者线段树 求最少逆序对)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18319 Accepted Submission(s): 11123Problem Description原创 2016-08-26 11:32:18 · 559 阅读 · 0 评论 -
hdu-1166敌兵布阵(线段树 部分数据的更新及求和)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 78233 Accepted Submission(s): 33048Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2016-08-26 11:28:19 · 304 阅读 · 0 评论 -
hdu-2612Find a way(bfs 求两个人到同一家kfs所需时间最短)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10758 Accepted Submission(s): 3538Problem DescriptionPass a year le原创 2016-08-26 11:22:50 · 272 阅读 · 0 评论 -
hdu-1698Just a Hook(线段树 改变部分的值并求和)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28558 Accepted Submission(s): 14152Problem DescriptionIn the game原创 2016-08-26 11:35:09 · 300 阅读 · 0 评论 -
hdu-2795Billboard(线段树 找到可以贴当前广告最上方的位置)
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19710 Accepted Submission(s): 8242Problem DescriptionAt the entranc原创 2016-08-26 11:41:18 · 303 阅读 · 1 评论 -
hdu-2717Catch That Cow(bfs 求最少几步达到指定值)
Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12531 Accepted Submission(s): 3876Problem DescriptionFarmer Joh原创 2016-08-26 11:39:42 · 353 阅读 · 0 评论 -
hdu-1754I Hate It(线段树 改变部分值并查找最大值)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 66037 Accepted Submission(s): 25675Problem Description很多学校流行一种比较的习惯。原创 2016-08-26 11:37:06 · 229 阅读 · 0 评论 -
poj-1611The Suspects(并查集求被感染的人数)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 34096 Accepted: 16539DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo原创 2016-08-25 16:37:06 · 381 阅读 · 0 评论 -
poj-3468A Simple Problem with Integers(线段树对部分数值的改变以及求和)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 96612 Accepted: 30145Case Time Limit: 2000MSDescriptionYou have N i原创 2016-08-25 15:26:01 · 613 阅读 · 0 评论 -
poj 3735Training little cats(矩阵快速幂 完成模拟 注意优化)
Training little catsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12392 Accepted: 3049DescriptionFacer's pet cat just gave birth to a brood of little原创 2016-09-04 15:53:20 · 350 阅读 · 0 评论 -
poj-1321棋盘问题(dfs 找出最多有几种摆放棋子的可能)
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36385 Accepted: 17950Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2016-08-26 11:43:27 · 2125 阅读 · 1 评论 -
poj 3233Matrix Power Series(矩阵快速幂 二分求和 求累乘的和)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 20868 Accepted: 8732DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2016-09-04 15:51:05 · 376 阅读 · 0 评论 -
poj 3984迷宫问题(bfs求最短路径 类似并查集保存上个节点 保存最短路径)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16343 Accepted: 9762Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0,原创 2016-09-04 15:54:58 · 1111 阅读 · 0 评论 -
poj 3009 Curling 2.0(冰壶 直到遇到障碍才停下 dfs)
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17962 Accepted: 7389DescriptionOn Planet MM-21, after their Olympic games this year, curling原创 2016-08-11 18:34:45 · 477 阅读 · 0 评论 -
快速幂的精简代码
#includeusing namespace std;long long ks(long long n,long long m){ long long ant=1; while(m>0) { if(m&1)//判断是否是偶数 ant*=n%1000; n=n*n%1000; m>>=1;//相当于除2 } return ant;} int main()原创 2016-04-19 19:52:26 · 571 阅读 · 0 评论 -
求大数乘方的前n位数字(对数加快速幂)
10的lga等于a 所以a的b次方相当于b*lga 得到一个指数gg 然后再求10的gg次方 再乘上10的n-1次方就是要的答案 思路都来自与学姐和大神#include#include#includeusing namespace std;long long ks(long long n,long long m){ long long ant=1; while(m>0原创 2016-04-19 20:03:18 · 773 阅读 · 1 评论 -
hdu——1061Rightmost Digit(快速幂)
Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45812 Accepted Submission(s): 17250Problem Description原创 2016-05-11 22:39:11 · 258 阅读 · 0 评论