鸡肋
文章平均质量分 63
这些编程题题解都是当初沉迷竞赛时所写,现在看来要思路没思路,要解析没解析,代码还一塌糊涂,笔者自己都看不懂了。但是删掉又舍不得,姑且将其放到这个专栏里吧。
木又可可
我渴望力量!
展开
-
【CSP】邻域均值
CSP 邻域均值原创 2023-01-01 20:57:34 · 847 阅读 · 1 评论 -
非零段划分
非零段划分原创 2022-12-19 18:07:42 · 177 阅读 · 0 评论 -
【BFS】HUD-Asteroids
HUD 1240 Asteroids!Asteroids!You’re in space.You want to get home.There are asteroids.You don’t want to hit them.InputInput to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the原创 2022-03-29 15:44:49 · 24128 阅读 · 0 评论 -
【图+并查集】Total Eclipse
Total Eclipse代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue>原创 2022-05-31 14:52:10 · 96 阅读 · 0 评论 -
【双指针】Bound Found
Bound Found代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue>#include <set>#in原创 2022-05-22 20:25:03 · 184 阅读 · 0 评论 -
【并查集】X-Plosives
X-Plosives并查集判环代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <que原创 2022-05-28 22:42:43 · 75 阅读 · 0 评论 -
【BFS】Find The Multiple
poj 1426 Find The MultipleFind The MultipleGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corre原创 2022-03-25 10:46:21 · 121 阅读 · 0 评论 -
【DFS】Channel Allocation
Channel AllocationWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater must be carefully chosen so that nearby repe原创 2022-04-13 11:23:33 · 146 阅读 · 0 评论 -
【DP】导弹拦截
导弹拦截导弹拦截某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能高于前一发的高度。某天,雷达捕捉到敌国的导弹来袭。由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹。输入导弹依次飞来的高度(雷达给出的高度数据是≤50000的正整数),计算这套系统最多能拦截多少导弹,如果要拦截所有导弹最少要配备多少套这种导弹拦截系统。输入格式1行,若干个整数(个数≤100000)输出格式2行,每原创 2022-05-05 16:16:00 · 154 阅读 · 0 评论 -
【STL】The SetStack Computer
The SetStack Computer记录一下STL里面求集合的交集和并集的方法set_intersection:求交集用法:set_intersection(第一个集合的开始,第一个集合的末尾,第二个集合的开始,第二个集合的末尾,inserter(结果集合名称,结果集合的开始));set\_intersection(第一个集合的开始, 第一个集合的末尾, 第二个集合的开始, 第二个集合的末尾,inserter(结果集合名称, 结果集合的开始));set_intersection(第一个集合的开原创 2022-05-24 15:10:53 · 90 阅读 · 0 评论 -
【BFS】抓住那头牛
poj 4001 抓住那头牛抓住那头牛农夫知道一头牛的位置,想要抓住它。农夫和牛都位于数轴上,农夫起始位于点N(0<=N<=100000),牛位于点K(0<=K<=100000)。农夫有两种移动方式:1、从X移动到X-1或X+1,每次移动花费一分钟2、从X移动到2*X,每次移动花费一分钟假设牛没有意识到农夫的行动,站在原地不动。农夫最少要花多少时间才能抓住牛?输入两个整数,N和K输出一个整数,农夫抓到牛所要花费的最小分钟数样例输入5 17样例输出4思路原创 2022-03-24 20:10:52 · 151 阅读 · 0 评论 -
【优先队列】Alice and the Cake
Alice and the Cake初看觉得有点像哈夫曼,但实际有差别。不过使用优先队列的思路是对的,但使用一个还不行,要用两个!!代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstring>#include <deque>#include <iostream>#include <list>#include原创 2022-05-23 14:23:32 · 113 阅读 · 0 评论 -
【模拟】Playlist
Playlist代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue>#in原创 2022-05-26 23:26:51 · 103 阅读 · 0 评论 -
【BFS】Prime Path
POJ 3126 Prime PathPrime PathThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.— It is a matter of security to change such thin原创 2022-03-25 15:47:05 · 147 阅读 · 0 评论 -
【并查集】红色警报
红色警报战争中保持各个城市间的连通性非常重要。本题要求你编写一个报警程序,当失去一个城市导致国家被分裂为多个无法连通的区域时,就发出红色警报。注意:若该国本来就不完全连通,是分裂的 kkk 个区域,而失去一个城市并不改变其他城市之间的连通性,则不要发出警报。输入格式:输入在第一行给出两个整数 N(0<N≤500)N(0 < N ≤ 500)N(0<N≤500) 和 M(≤5000)M(≤5000)M(≤5000),分别为城市个数(于是默认城市从 000 到 N−1N-1N−1 编号原创 2022-03-08 21:17:56 · 224 阅读 · 0 评论 -
【二分】Caravan Robbers
Caravan RobbersLong long ago in a far far away land there were two great cities and The Great Caravan Road between them. Many robber gangs “worked” on that road.By an old custom the i-th band robbed all merchants that dared to travel between ai and bi mi原创 2022-05-21 19:48:58 · 104 阅读 · 0 评论 -
【枚举】连续因子
枚举原创 2022-08-05 19:06:20 · 172 阅读 · 0 评论 -
【枚举】POJ 1416 Shredding Company
POJ 1416 Shredding CompanyShredding CompanyYou have just been put in charge of developing a new shredder for the Shredding Company Although a “normal” shredder would just shred sheets of paper into little pieces so that the contents would become unreadab原创 2022-04-11 19:12:58 · 354 阅读 · 0 评论 -
【DFS】连连看
连连看“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只能将错就错了,连线不能从外围绕过。玩家鼠标先后点击两块棋子,试图将他们消去,然后游戏的后台判断这两个方格能不能消去。现在你的任务就是写这个后台程序。原创 2022-04-14 08:28:47 · 204 阅读 · 0 评论 -
【BFS】Friend Chains
HDU 4460 Friend ChainsFriend ChainsFor a group of people, there is an idea that everyone is equals to or less than 6 steps away from any other person in the group, by way of introduction. So that a chain of “a friend of a friend” can be made to connect a原创 2022-03-30 11:07:23 · 188 阅读 · 0 评论 -
【双指针】Jessica‘s Reading Problem
Jessica’s Reading Problem代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include原创 2022-05-22 17:13:57 · 92 阅读 · 0 评论 -
【BFS】Pots
poj 3414 PotsPotsYou are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) empty the pot i to the drain;POUR(i,j) pour fro原创 2022-03-25 21:20:02 · 268 阅读 · 0 评论 -
【二分】Cellular Network
Cellular Network代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue原创 2022-05-21 21:26:27 · 98 阅读 · 0 评论 -
【树的DFS遍历】病毒溯源
病毒溯源天梯赛 L2-038 病毒溯源病毒容易发生变异。某种病毒可以通过突变产生若干变异的毒株,而这些变异的病毒又可能被诱发突变产生第二代变异,如此继续不断变化。现给定一些病毒之间的变异关系,要求你找出其中最长的一条变异链。在此假设给出的变异都是由突变引起的,不考虑复杂的基因重组变异问题 —— 即每一种病毒都是由唯一的一种病毒突变而来,并且不存在循环变异的情况。输入格式:输入在第一行中给出一个正整数 N(≤10^4),即病毒种类的总数。于是我们将所有病毒从 0 到 N−1 进行编号。随后 N原创 2022-03-15 12:19:50 · 97 阅读 · 0 评论 -
【并查集】Equals
Equals代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue>#incl原创 2022-05-29 11:54:18 · 64 阅读 · 0 评论 -
【DP】最长公共子序列
最长公共子序列题目传送门记录一下最长公共子序列的模板,包含打印#include <cstdio>#include <cstring>#include <iostream>using namespace std;const int MAXN = 1005;int dp[MAXN][MAXN], path[MAXN];char s[MAXN], str[MAXN];int n, m;void solve() { scanf("%s%s",原创 2022-04-17 22:12:39 · 315 阅读 · 0 评论 -
【set】Andy‘s First Dictionary
Andy’s First Dictionary使用set的迭代器可以将set里面的元素按顺序输出,并且这个顺序可以自定义代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map原创 2022-05-22 21:18:10 · 71 阅读 · 0 评论 -
【线段树】Balanced Lineup
摘要原创 2022-06-01 21:08:16 · 102 阅读 · 0 评论 -
【DFS】Sudoku
POJ 2676 SudokuSudokuSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The other cells are empty. The goal is to原创 2022-04-10 21:24:49 · 510 阅读 · 0 评论 -
【map】Ananagrams
Ananagrams代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstring>#include <deque>#include <iostream>#include <list>#include <map>#include <queue>#include <set>#inc原创 2022-05-23 11:09:27 · 75 阅读 · 0 评论 -
【DFS】Network Saboteur
poj 2531 Network SaboteurNetwork SaboteurA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between原创 2022-04-01 22:50:24 · 229 阅读 · 0 评论 -
【单调栈】Largest Rectangle in a Histogram
Largest Rectangle in a Histogram单调栈"暴力"法代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list>#include <ma原创 2022-05-31 17:19:08 · 77 阅读 · 0 评论 -
【二分】Subsequence
Subsequence额,一个坑点是UVA和POJ都有这道题,但是两个OJ的输入形式不一样,这里是UVA的代码代码如下#include <algorithm>#include <climits>#include <cmath>#include <cstdio>#include <cstring>#include <deque>#include <iostream>#include <list&g原创 2022-05-21 22:48:29 · 110 阅读 · 0 评论 -
【单调队列】Sliding Window
00原创 2022-05-31 22:42:07 · 102 阅读 · 0 评论