- 博客(14)
- 收藏
- 关注
RSS订阅原创 HihoCoder - 1634 Puzzle Game （最大子矩阵和）
Puzzle GameOnce upon a time, there was a little dog YK. One day, he went to an antique shop and was impressed by a beautiful picture. YK loved it very much. However, YK did not have money to buy ...
2019-09-28 09:12:51
237
原创 Gym - 101981 Problem M. Mediocre String Problem (扩展KMP + Manacher)
Problem M. Mediocre String Problem题目链接：https://vjudge.net/problem/Gym-101981M题目大意：给出两个串S，T，从S中选择 i~j 的子串，再从T中选择前缀 1~k 接在S的子串后面 组成一个新字符串，要求 j-i+1>k，问能构成的新串中是回文串的个数思路：因为要求j-i+1>k，即S中选择的子串x比...
2019-09-25 21:34:02
497
原创 2019icpc上海网络赛
比赛链接：The Preliminary Contest for ICPC Asia Shanghai 2019L. Digit sum签到题题目大意：给出n，b，求1-n 的b进制的各个位数之和思路：因为n就到10^6可以直接预处理打表。 或者也可以数位DP代码：#include<stdio.h>#include<string.h>#in...
2019-09-19 11:13:30
456
2
原创 2019网络赛总结
这么多场网络赛下来，发现了很多自己的不足：首先就是网络赛中遇到很多题目都是会的算法，但是没办法灵活的运用。就像ccpc网络赛有一道后缀数组+主席树的题，知道是后缀数组，但是不知道要到底要怎么做。还有之前学的有些算法，很久没有用过，现在已经不太熟悉了。在网络赛中发现现在还是有很多算法是还没有学的，甚至连模板都还没有，特别是数论这方面的知识还很欠缺。要找一段时间好好看看数论，刷刷数论专题，把模...
2019-09-18 16:28:55
166
原创 POJ - 1873 The Fortified Forest （凸包 + 枚举）
The Fortified ForestOnce upon a time, in a faraway land, there lived a king. This king owned a small collection of rare and valuable trees, which had been gathered by his ancestors on their trave...
2019-09-12 20:39:31
321
原创 POJ - 1228 Grandpa's Estate (稳定凸包 )
Grandpa's EstateBeing the only living descendant of his grandfather, Kamran the Believer inherited all of the grandpa's belongings. The most valuable one was a piece of convex polygon shaped farm...
2019-09-12 17:36:03
219
1
原创 POJ - 1265 Area （计算几何 Pick定理 叉积）
AreaBeing well known for its highly innovative products, Merck would definitely be a good target for industrial espionage. To protect its brand-new research and development facility the company h...
2019-09-12 10:23:49
136
原创 POJ - 1654 Area （计算几何 叉积 求多边形面积）
AreaYou are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the f...
2019-09-11 20:48:29
150
原创 LightOJ - 1203 Guarding Bananas（凸包 求最小夹角 Graham扫描算法 | 卷包裹算法）
Guarding BananasOnce there was a lazy monkey in a forest. But he loved banana too much. One day there was a storm in the jungle and all the bananas fell from the trees. The monkey didn't want to los...
2019-09-11 19:50:13
223
原创 POJ - 3348 Cows （凸包 求多边形面积 Graham扫描算法）
CowsYour friend to the south is interested in building fences and turning plowshares into swords. In order to help with his overseas adventure, they are forced to save money on buying fence posts...
2019-09-10 16:30:46
147
原创 POJ - 1113 Wall （凸包 Graham扫描算法 | 卷包裹算法）
WallOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. The King was so greedy, that he would not listen to his Architect's proposal...
2019-09-09 20:55:59
139
原创 POJ - 2007 Scrambled Polygon （凸包 极角排序）
Scrambled PolygonA closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts ...
2019-09-09 20:42:18
158
原创 The Preliminary Contest for ICPC Asia Xuzhou 2019 D. Carneginon （KMP）
D. Carneginon题目链接：https://nanti.jisuanke.com/t/41386题目大意：给一个母串T，接下来给n个串S，如果S的长度与T的长度相等：如果S与T串相同，输出：jntm!，否则输出：friend!， 如果S的长度比T小，如果S是T的子串，输出：my child!，否则输出：oh, child! ， 如果S的长度比T大，如果T是S的子串，输出：my t...
2019-09-07 20:04:31
110
原创 Gym - 102222G Factories （树形DP）
FactoriesByteland hasnncities numbered from11tonn, andn−1n−1bi-directional roads connecting them. For each pair of cities, the residents can arrive one from another one through these roads...
2019-09-05 17:35:22
571
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人