Activity Calendar
Loading...
Radar Chart
Loading...
Release Chart
Loading...
Classification Chart
Loading...
Tag Chart
Loading...
New thing
New thing
此条为私密说说,仅发布者可见
January 8th, 2023 at 12:38 am
思考了好几天后,我打算去世界各地散散心我把花店关了,但是店铺还留着,和那些花一起结束了最后一次的细心照护后就前往异国他乡游历了多个国家,观看了无数风景,看过了数不胜数的花内心的伤痛也仿佛不见了过了好多年后,偶然想去了故乡和花店便回来看看故乡仍然是记忆里的模样,令人安心花店里被很多花草所覆盖着花了一天的功夫才把花店整理好店铺又如当初一样的美好了不过就算是这样记忆里那个喜欢花的女孩也不会再出现就...
December 19th, 2022 at 09:20 pm
A leetcode a day, keep your confidence away.
November 30th, 2022 at 01:56 pm
username
password
Login
logging in...
Articles published by mi0e
Home
mi0e
小根堆
#include<bits/stdc++.h> using namespace std; const int N = 1e6+10; int...
集合与并查集
集合#include<bits/stdc++.h> using namespace std; const int N = 100010; i...
KMP
#include<bits/stdc++.h> using namespace std; const int N = 100, M = 100...
单调栈、滑动窗口(单调队列)
单调栈#include<bits/stdc++.h> using namespace std; const int N = 100; int...
双指针数组去重
#include<bits/stdc++.h> using namespace std; const int N = 100; int n;...
离散化区间和
#include<bits/stdc++.h> using namespace std; const int N = 100; typedef...
gcd与欧拉质数筛模板
欧几里得辗转相除法$gcd(a, b)=gcd(b,a\ mod\ b)=···=gcd(n,0)$int gcd(int a, int b){ ...
树的直径
DFSinclude<bits/stdc++.h>using namespace std;const int N = 100010;struc...
1
2
3
4
5
6
7
8
...
14
Article Directory
首页
复制
搜索
前进
后退
重载网页