算法
Apollo-yyy
考研失败的华子5G工程师一枚
展开
-
Dijkstra算法1.0
Silver Cow Party poj3268 One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) u原创 2017-12-14 17:13:24 · 380 阅读 · 0 评论 -
POJ-1611-The Suspects
The SuspectsSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best st...原创 2018-04-07 21:07:52 · 119 阅读 · 0 评论 -
喊山
L3-008. 喊山时间限制 150 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 陈越喊山,是人双手围在嘴边成喇叭状,对着远方高山发出“喂—喂喂—喂喂喂……”的呼唤。呼唤声通过空气的传递,回荡于深谷之间,传送到人们耳中,发出约定俗成的“讯号”,达到声讯传递交流的目的。原来它是彝族先民用来求援呼救的“讯号”,慢慢地人们在生...原创 2018-03-25 15:33:50 · 557 阅读 · 0 评论 -
POJ-2236-Wireless Network
Wireless NetworkAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all ...原创 2018-04-08 21:30:29 · 156 阅读 · 0 评论 -
PAT月饼
1020. 月饼 (25)时间限制 100 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue月饼是中国人在中秋佳节时吃的一种传统食品,不同地区有许多不同风味的月饼。现给定所有种类月饼的库存量、总售价、以及市场的最大需求量,请你计算可以获得的最大收益是多少。注意:销售时允许取出一部分库存。样例给出的情形是...原创 2018-03-26 16:07:16 · 632 阅读 · 0 评论 -
轨道调度
L2-014. 列车调度时间限制 300 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 陈越火车站的列车调度铁轨的结构如下图所示。两端分别是一条入口(Entrance)轨道和一条出口(Exit)轨道,它们之间有N条平行的轨道。每趟列车从入口可以选择任意一条轨道进入,最后从出口离开。在图中有9趟列车,在入口处按照{8...原创 2018-03-26 17:17:49 · 546 阅读 · 0 评论 -
poj-1308-Is It A Tree?
Is It A Tree?A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following prop...原创 2018-04-09 21:49:45 · 187 阅读 · 0 评论 -
HDU-1272-小希的迷宫
小希的迷宫上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让...原创 2018-04-09 21:57:02 · 159 阅读 · 0 评论 -
1004 Counting Leaves
1004. Counting Leaves (30)时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A family hierarchy is usually presented by a pedigree tree. Your job is to count those family ...原创 2018-03-27 17:10:41 · 295 阅读 · 0 评论 -
Product of Polynomials
1009. Product of Polynomials (25)时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, YueThis time, you are supposed to find A*B where A and B are two polynomials.Input Speci...原创 2018-04-02 20:27:57 · 263 阅读 · 0 评论 -
1002 A+B for Polynomials
1002. A+B for Polynomials (25)时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, YueThis time, you are supposed to find A+B where A and B are two polynomials.InputEach in...原创 2018-03-28 17:41:19 · 160 阅读 · 0 评论 -
HDU-1213 How Many Tables
Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, a...原创 2018-04-03 21:57:35 · 119 阅读 · 0 评论 -
POJ-2492-A Bug's Life
A Bug’s LifeBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of th...原创 2018-04-12 14:02:01 · 186 阅读 · 0 评论 -
看懂二叉树的三种遍历
转载自https://blog.csdn.net/soundwave_/article/details/53120766二叉树有三种遍历方式,前序遍历(preorder traversal ),中序遍历(inorder traversal ),后序遍历(postorder traversal )。下面给出详细的解释: 1.先(根)序遍历的递归算法定义: 若二叉树非空,则依次执行如下...转载 2018-04-18 20:16:30 · 3291 阅读 · 4 评论 -
HDU-2973-YAPTCHA
YAPTCHAThe math department has been having problems lately. Due to immense amount of unsolicited automated programs which were crawling across their pages, they decided to put Yet-Another-Public-Tur...原创 2018-05-08 21:43:51 · 194 阅读 · 0 评论 -
素数筛选的几种方法
法一:暴力法简而言之,就是根据素数的定义去筛选,即只能被1和本身整除。这种做法的弊端也显而易见——太耗时。本地测试了一下,最多筛选到十万左右。 代码如下:#include<iostream>#include<cmath>using namespace std;int prime[10010];int main(){ prime[0]=2;prim...原创 2018-05-09 22:06:34 · 1272 阅读 · 0 评论 -
PTA-数据结构与算法-最大子列和问题
最大子序列和问题给定K个整数组成的序列{ N1, N2, …, NK },“连续子列”被定义为{ Ni, Ni+1, …, Nj },其中 1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 },其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序,计算给定整数...原创 2018-05-10 20:12:01 · 2184 阅读 · 5 评论 -
取球博弈
取球博弈题目描述:今盒子里有n个小球,A、B两人轮流从盒中取球,每个人都可以看到另一个人取了多少个, 也可以看到盒中还剩下多少个,并且两人都很聪明,不会做出错误的判断。我们约定: 每个人从盒子中取出的球的数目必须是:1,3,7或者8个。 轮到某一方取球时不能弃权! A先取球,然后双方交替取球,直到取完。 被迫拿到最后一个球的一方为负方(输方)。请编程确定出在双方都不判断失误的情况下...原创 2018-05-07 17:57:56 · 208 阅读 · 0 评论 -
CF-High School: Become Human
High School: Become HumanYear 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids have to go to school to be able to solve creative tasks. Just l...原创 2018-06-05 16:34:19 · 244 阅读 · 0 评论 -
Multiplication Table
Bizon the Champion isn’t just charming, he also is very smart.While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n ×...原创 2018-07-23 23:20:09 · 1814 阅读 · 1 评论 -
免费馅饼
都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝...原创 2018-07-25 10:38:15 · 149 阅读 · 0 评论 -
FatMouse's Speed
FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequence...原创 2018-07-25 22:14:37 · 300 阅读 · 0 评论 -
HDU-1159- Common Subsequence
Common Subsequence 解题思路:本题是基础DP问题中的最大公共子序列问题(LCS),之前写过几遍但再次写还是没写对,主要还是对于状态转移的描述不够准确。对于自顶而下的描述,找准符合局部最优的贪心描述是关键。本题的DP数组是一个二维数组,代表从1-i和从1-j两个字符串的最长公共子序列。用一个循环嵌套构建自顶而下的DP树,最后的DP[n][m]就是最优解了。比较两个字符...原创 2018-07-15 10:53:51 · 176 阅读 · 0 评论 -
HDU-1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping!Nowadays, 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 intro...原创 2018-07-15 11:07:38 · 182 阅读 · 0 评论 -
FATE
最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s只怪。请问他能升掉这最后一级吗?Inp...原创 2018-07-29 10:15:40 · 448 阅读 · 0 评论 -
Employment Planning
A project manager wants to determine the number of the workers needed in every month. He does know the minimal number of the workers needed in each month. When he hires or fires a worker, there will b...原创 2018-07-29 17:08:23 · 430 阅读 · 0 评论 -
Max Sum
Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. InputThe f...原创 2018-07-29 21:29:45 · 146 阅读 · 0 评论 -
Happy Programming Contest
In Zhejiang University Programming Contest, a team is called “couple team” if it consists of only two students loving each other. In the contest, the team will get a lovely balloon with unique color f...原创 2018-07-30 11:02:35 · 257 阅读 · 0 评论 -
STL-MAP
转载一篇不错的MAP简介文点击这里转载 2018-07-22 21:18:10 · 149 阅读 · 0 评论 -
Money Transfers
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbour...原创 2018-07-22 23:15:06 · 390 阅读 · 0 评论 -
codeforces 502 div1+div2 C. The Phone Number
题目大意:给一个数列长度n,要求输出一个最长上升序列长度和最长下降数列长度和最小的数列。解题思路:这个我是靠观察答案蒙出来的。具体算法的证明我也不懂。。。。答案将数列分段,每一段都是连续上升数列,这样LIS的长度就是每一段的长度,LDS的长度就是它可以分为几段。分段的依据就是n的根号,例如小于9大于3的每段长度为2(LIS长度),大于9小于16的每段长度为3。另一个难点在于输出,之...原创 2018-08-09 14:29:22 · 211 阅读 · 0 评论 -
codeforces-round501-div3
A.Points in Segments 题目大意:给你n个小区间和最大边界m,这n个区间分布在1-m的大数轴区间上,请你输出这个数轴上不属于任何小区间的数的数目和本身。解题思路:将输入的区间遍历对区间内的数字进行唯一标记并统计数量sum,则未在任何小区间的数字数目就是m-sum,最后遍历大区间,未被标记的就是不在任何小区间的数了。 代码如下:#include<...原创 2018-08-06 00:04:28 · 230 阅读 · 0 评论 -
最长回文
给出一个只由小写英文字符a,b,c…y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等Input输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c…y,z组成的字符串S 两组case之间由空行隔开(该空行不用处理) 字符串长度len &amp;lt;= 110000Output每一行一个整数x,对应一组c...原创 2018-08-10 15:23:21 · 277 阅读 · 0 评论 -
POKER(扑克)
解题思路:这个题做法很多,我直接按照题意模拟了一下,复杂度O(n),记录一下右边界,每次得到算术平方根后与上一个结果进行比较,相同则放到数组右边界,否则更新上一个结果。 代码如下:#include<iostream>#include<cstdio>#include<fstream>#include<set>#include&...原创 2018-08-14 19:58:25 · 777 阅读 · 0 评论 -
字符串HASH算法入门
放个链接好了:字符串哈希入门转载 2018-08-11 16:56:02 · 475 阅读 · 0 评论 -
Oulipo-HDU-1686 哈希
这个题我之前用kmp板子写过一次,这次开始学习哈希,再上一个单哈希的方法,就当入门模板吧。思路:算出子字符串的哈希值,然后遍历主字符串枚举起点,算出和相同长度子串的哈希值,如果值相同则答案加1。 代码如下:#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;fstream&gt;#include&原创 2018-08-12 16:18:13 · 282 阅读 · 1 评论 -
HDU-1711-Number Sequence
Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 &amp;lt;= M &amp;lt;= 10000, 1 &amp;lt;= N &amp;lt;= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b...原创 2018-08-08 09:48:42 · 186 阅读 · 0 评论 -
codeforces 490 div3 D. Equalize the Remainders
题目大意:给你n个数和一个m,要求余数为0-m-1的数的数量正好是n/m,m保证是n的因子,每个数只能执行加的操作,最后输出操作的次数以及修改后的数组结果。解题思路:主题思想是贪心,就是让那些余数值超过n/m的数向离他最近且余数值没有满足条件的数“移动”。这里的“移动”有个巧妙的处理,就是利用STL集合中的set.lower_bound()函数,集合中保存那些未满足条件的余数值,l...原创 2018-08-15 16:57:17 · 207 阅读 · 0 评论 -
POJ-3461-Oulipo
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book:Tout avait Pair normal, mais tout s’...原创 2018-08-08 16:19:03 · 210 阅读 · 0 评论 -
codeforces div3 494 B. Binary String Constructing
题目大意:给你n个0和m个1,要求输出有k个不同的“01”字符串(比如010110有4个不同,1010101有6个不同)。解题思路:一个思维题。构造一个这样的字符串首先知道一个01或者10就有一个不同,n个就有2*n-1个不同,因为答案要求是k,所以n=k/2,理论上01或者10都可以,但是由于0和1数量不同所以数量多的先输出,比如0多就先输出01,最后根据k是奇数还是偶数还有n,...原创 2018-08-13 15:41:49 · 150 阅读 · 0 评论