![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BestCoder
exmy
Less is more, and more is less.
展开
-
BestCoder Round #72 (div.2) A.Clarke and chemistry
& hdoj 5625题解:枚举 a 和 b 的值,用三个数组分别记录A, B, C三种物质所含的元素。#include #include #include #include #include #include #include #include using namespace std;int a[30], b[30], c[30];int main()原创 2016-02-13 22:52:51 · 435 阅读 · 0 评论 -
BestCoder Round #72 (div.2) B.Clarke and points
& hdoj 5626题意:平面上n个点,求两点间最大的曼哈顿距离。题解:假设A, B两点使得曼哈顿距离最大,去绝对值,可以化简如下:则只要分别求出最大和最小的、即可。#include #include #include #include using namespace std;typedef long long ll;const int原创 2016-02-14 00:06:50 · 421 阅读 · 0 评论 -
2016"百度之星" - 资格赛(Astar Round1)Problem A
A题解用 dp[i] 表示前 i 个字符的 hash 值,那么子串 Sa...bS_{a...b}的 hash 值: H(s)=dp[b]/dp[a−1]%mod H(s) = dp[b] / dp[a - 1] \% mod 嗯,这里1/dp[a−1]%mod1 / dp[a - 1] \% mod的计算是一个逆元。#include <iostream>#include <cstdio>#原创 2016-05-15 00:35:19 · 937 阅读 · 0 评论 -
2016"百度之星" - 资格赛(Astar Round1)Problem B
B题解推下前几个,发现这是一个斐波那契数列。 高精度。#include <iostream>#include <cstdio>#include <string>#include <algorithm>using namespace std;typedef unsigned long long ull;const int maxn = 210;string dp[maxn];stri原创 2016-05-15 00:38:22 · 410 阅读 · 0 评论 -
2016"百度之星" - 资格赛(Astar Round1)Problem C
C题解字典树。#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>using namespace std;const int maxn = 26;struct Trie{ int cnt; Trie* next[maxn]; Trie()原创 2016-05-15 00:40:18 · 547 阅读 · 0 评论 -
2016"百度之星" - 资格赛(Astar Round1)Problem D
D题解sort + map#include <iostream>#include <string>#include <map>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int main(){ //freopen("D.in", "r", stdin); int n原创 2016-05-15 00:42:39 · 1408 阅读 · 2 评论