Qyif-CSDN博客

原创 Spectral Hashing 论文解读

谱哈希

2023-10-03 16:28:44 98

原创 kuangbin 专题十六：KMP & 扩展KMP Manacher

1. Number Sequence题解：这是一道kmp的模板题目套版即可#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N = 1000010;int n, m, t, f;int ne[N];int a[N], b[N];//获取next数组void getNe() {

2021-05-10 21:41:45 262

原创 kuangbin 专题五: 并查集

1. Wireless Network/*这道算是并查集的模板题了，主要需要弄清楚的是连接的条件。在这连接的条件是连个点之间的距离要小于等于d（即题目给定的距离），与此同时还要判断你要连接的电脑是否已经被修理过了，因为只有被修好的电脑才能充当中转站。最终本题的思路就是，先接受输入的点的坐标，然后接受若干个操作，当操作为O时，枚举所有点与当前点之间的关系（包括距离和是否被修复）符合条件就把两点连接。如果是S操作，那就判断两点是否连接，连接就输出SUCCESS否则输出FAIL。*/#include&l

2021-04-20 00:35:50 323 1

原创蓝桥杯C++转java笔记（临时抱佛脚）

c++ 转 java输入篇//创建一个cinScanner cin = new Scanner (new BufferedInputStream(System.in));//读一个整数：int n = cin.nextInt(); //相当于 scanf(”%d”, &n); 或 cin >> n;//读一个字符串：String s = cin.next(); //相当于 scanf(”%s”, s); 或 cin >> s;//读一个浮点数：double

2021-04-17 13:37:59 444 5

原创 kuangbin 专题二十三: 区间DP

1. Cake题目链接：kaungbin传送门zoj传送门#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>using namespace std;const int N = 1005;struct Node { int x, y;} nodes[N], pack[N];int cost[N

2021-04-07 14:17:47 194 2

原创二分查找（折半查找）详解

二分查找的引入说到二分查找相信大家都很熟悉，最经典的例子就是猜数字问题：从1到100中，随机抽取一个数字。现在然你猜测这个数字究竟是多少，如果你猜的数字大于目标值，则会提示你该值大了；反之则会提示你该值小了。对于这道题有多种解法，首先最简单的方法就是都从头开始往后猜，这样的方法简单暴力，但是非常慢，最坏的情况下可能要猜测100个数字才把这个数字才出来。但如果说使用二分查找就不一样了，二分的猜法就快多了。假设现在产生了一个随机值：37...

2021-01-10 12:03:45 10334

原创 kuangbin 数学训练二 Arrange the Numbers

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const ll N = 1010;const ll p = 1000000007;ll t, n, m, r, ca;ll fact[N], infact[N], d[N];//快速幂模板ll qm

2020-11-29 10:29:48 168

原创 kuangbin 数学训练二 Combinations

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const ll N = 1e6 + 10;const ll p = 1000003;ll t, n, x, y, ca;ll fact[N], infact[N];//快速幂模板ll qmul(ll

2020-11-29 10:29:13 101

原创 kuangbin 数学训练二 Parallelogram Counting

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const int N = 1010;const int M = 1000010;ll t, ca, n;struct Node { int x, y;} dot[N], m[M];//排序函数

2020-11-29 10:24:46 75

原创 kuangbin 数学训练二 Rooks

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const int N = 50;ll t, n, k, ca, ans, c[50][50];//阶乘公式ll mul(ll n) { ll tmp = 1; for(ll i = 1; i &l

2020-11-29 10:24:20 110

原创哈尔滨理工大学软件与微电子学院程序设计竞赛总结

题目链接：传送门A 抗疫必胜1#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 200010;int t, n, k;int main() { printf("V V\n"); pr

2020-11-28 01:00:05 377

原创 kuangbin 数学训练一 Consistent Verdicts

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 1e6;int t, n, ans, ca, idx;double d[N];struct Nodes { double x,

2020-11-24 15:11:11 189

原创 week8 数学训练一

数学训练一LightOJ 1008 Fibsieve`s Fantabulous Birthday LightOJ 1010 Knights in ChessboardLightOJ 1020 A Childhood GameLightOJ 1078 Integer DivisibilityLightOJ 1116 Ekka DokkaLightOJ 1148 Mad CountingLightOJ 1179 Josephus ProblemLightOJ 1275 Internet Ser

2020-11-23 19:40:25 216

原创 kuangbin 数学训练一 Billiard Balls

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const int N = 200010;struct Node { ll x, y;} nodes[N];//排序函数，x升序，y升序。bool cmp(Node a, Node b) { if

2020-11-23 18:41:02 159

原创 kuangbin 数学训练一 Eid

题目链接：传送门import java.util.Scanner;import java.math.BigInteger;public class Main { public static void main(String[] args) { Scanner src = new Scanner(System.in); int n, t; t = src.nextInt(); for (int i = 1; i <= t;

2020-11-22 23:12:03 109

原创小白月赛17训练总结

小白月赛17题目链接：传送门A.小sun的假期#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 100010;struct Day { ll l, r;} days[N], pl[N];ll

2020-11-22 16:36:56 115

原创 kuangbin 数学训练一 February 29

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<map>#define ll long longusing namespace std;const int N = 1010;string m1, m2;ll d1, d2, y1, y2, t, ca;map<string, ll> mo

2020-11-21 14:37:56 101

原创 kuangbin 数学训练一 Answering Queries

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<cmath>#include<bitset>#define ll long longusing namespace std;const int N = 100010;ll ca, t, n, q,

2020-11-21 14:16:54 102

原创 kuangbin 数学训练一 IP Checking

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<cmath>#include<bitset>#define ll long longusing namespace std;const int N = 5;int k, t, num[N];st

2020-11-21 11:24:09 125

原创 kuangbin 数学训练一 Aladdin and the Optimal Invitation

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<cmath>#define ll long longusing namespace std;const int N = 50010;//创建一个结点，包含x，y两坐标和出现的次数wstruct Node {

2020-11-21 11:04:06 114

原创 kuangbin 数学训练一 Unlucky Bird

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<cmath>#define ll long longusing namespace std;const int N = 50010;double v1, v2, v3, a1, a2, d, ti, s;in

2020-11-21 11:02:37 123

原创 kuangbin 数学训练一 Largest Box

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 200010;int ca, t;double l, w, x, v;int main() { scanf("%d", &amp

2020-11-20 17:39:31 120

原创 kuangbin 数学训练一 Positive Negative Sign

题目链接：传送门#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>#define ll long long using namespace std;const int N = 55;ll t, n, m, ans, k;int main() { scanf("%lld", &t); while

2020-11-20 17:38:55 174

原创 kuangbin 数学训练一 Internet Service Providers

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 200010;ll t, ca, n, c;int main() { scanf("%lld", &t); while(

2020-11-20 17:38:26 78

原创 kuangbin 数学训练一 Josephus Problem

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N = 200010;int t, n, k, ca;int main() { scanf("%d", &t); while(t--) { scanf("%d%d", &n, &k); in

2020-11-20 17:38:00 82

原创 kuangbin 数学训练一 Mad Counting

题目链接：传送门#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>#include<vector>#define ll long longusing namespace std;const int N = 1e6 + 10;ll t, n, k, num, cnt[N];vector<l

2020-11-20 17:37:33 101

原创 kuangbin 数学训练一 Ekka Dokka

题目链接：传送门#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>#define ll long longusing namespace std;const int N = 200010;ll t, w, k, n;int main() { scanf("%lld", &t); while(t

2020-11-20 17:37:09 144

原创 kuangbin 数学训练一 Integer Divisibility

题目链接：传送门#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#define ll long longusing namespace std;const int N = 200010;ll t, n, m, k, num, ans = 1;int main() { scanf("%lld", &t); while(t--) {

2020-11-20 17:36:46 87

原创 kuangbin 数学训练一 A Childhood Game

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;int sto, k, t;string name;int main() { cin >> t; while(t--) { cin >

2020-11-20 17:36:14 89

原创 kuangbin 数学训练一 Knights in Chessboard

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;int t, n, m, k, ans;int main() { scanf("%d", &t); while(t--) { scanf("%d%

2020-11-20 17:35:41 99

原创 kuangbin 数学训练一 Fibsieve`s Fantabulous Birthday

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long longusing namespace std;ll t, num, x, y, k;int main() { scanf("%lld", &t); while(t--) { scanf("%l

2020-11-20 17:35:14 144

原创 Weak 5 kuangbin 算法作业二分尺取单调栈队列

二分尺取单调栈队列:CodeForces - 371C HamburgersPOJ - 3122 Pie HDU - 4768 Flyer HDU - 4190 Distributing Ballot Boxes HDU - 3244 Inviting Friends POJ - 2100 Graveyard Design HDU - 5672 String HDU - 5178 pairs HDU - 1937 Finding Seats [HDU - 4122 Alice’s m

2020-11-01 18:13:13 96 3

原创 kuangbin 专题二十三：二分尺取单调栈队列 Flyer

#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<vector>#define ll long longusing namespace std;const int N = 200010;ll sum[N], a[N], b[N], c[N], n;ll cal(ll x) { ll num = 0; for(ll i

2020-11-01 17:50:19 84

原创 kuangbin 专题二十三：二分尺取单调栈队列 String

题目连接：传送门#include<iostream>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const int N = 30;const int M = 1000010;int t, k, cnt[N];char str[M]; int main() { scanf("%d", &t); while(t--) { //输

2020-11-01 17:27:15 174

原创 kuangbin 专题二十三：二分尺取单调栈队列 Finding Seats

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3fusing namespace std;const int N = 310;int r, c, k, sum[N][N];char tmp[N];//获取区间和int getSum(int x1, int y1, int x2, int

2020-11-01 17:26:38 89

原创 kuangbin 专题二十三：二分尺取单调栈队列 Graveyard Design

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#define ll long longusing namespace std;const int N = 100010;//用于存取答案vector<vector<ll> &g

2020-11-01 17:25:55 110

原创 kuangbin 专题二十三：二分尺取单调栈队列 pairs

题目链接:传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define ll long longusing namespace std;const int N = 100010;ll t, n, k, x[N];int main() { //输入测试例子数 scanf("%lld", &t); while(t--) {

2020-11-01 17:25:13 75

原创 kuangbin 专题二十三：二分尺取单调栈队列 Distributing Ballot Boxes

题目连接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int N = 500010;int n, m, a[N], ans;int main() { while(scanf("%d%d", &n, &m) != EOF) {

2020-11-01 17:24:23 78

原创 kuangbin 专题二十三：二分尺取单调栈队列 Pie

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int N = 10010;//这里一定要注意精度，一开始我写了1e-6结果wa了const double DIF = 1e-8;const double PI = acos(-1.0);

2020-11-01 17:23:42 296

原创 kuangbin 专题二十三：二分尺取单调栈队列 Inviting Friends

题目链接：传送门#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ll long long#define INF 0x3f3f3f3fusing namespace std;const int N = 800000;const int M = 110;int ans, n, m, x[M],

2020-10-31 14:44:30 79

空空如也

空空如也