自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(15)
  • 收藏
  • 关注

原创 Unity&Facepunch 使用tips

1.初始化的部分只能放在start不能放在awake,不然会影响到一些奇怪的点。目前受影响的有:fmod初始化加载。

2023-07-05 16:14:38 66

原创 Unity Localization插件使用tips

Office:保存时直接在工具-web选项-编码-将此文档另存为utf-8。WPS:保存后以txt打开,随后另存为csv,编码调整为utf-8。csv需要注意修改后要保持utf8编码格式,不然导入后会乱码。1.导入csv乱码问题。

2023-04-04 20:30:20 295

原创 【板子】并查集

1、普通#include <bits/stdc++.h>using namespace std;const int maxn=200000;int parent[maxn];//num记i中点的数量int find(int x)//查找且缩点{ if(x!=parent[x]) { parent[x]=find(parent[x]); ...

2020-10-31 10:38:49 66

原创 【板子】最小生成树

1.Kruskal#include <iostream>#include <cmath>#include <cstdio>#include <string.h>#include <stdio.h>#include <algorithm>using namespace std;int n;struct ed...

2020-10-31 10:38:42 54

原创 【板子】匈牙利算法

bool g[maxn][maxn];//邻接矩阵int used[maxn];//右边的点是否访问int match[maxn];//右边的点匹配的点int dfs(int s){ for (int i = 1; i <= n; i++) { if (used[i] == 1 || g[s][i] == 0) continu...

2020-10-31 10:38:33 61

原创 【板子】KM(n3板子)

#include <bits/stdc++.h>using namespace std;#define ll long long//算法使用//w[maxn][maxn] 数组表示图的邻接矩阵 //pop表示二分图的左右两边的点的数量 //点从0到n-1 //const int maxn = 50;const int inf = 0x3f3f3f3f;in...

2020-10-31 10:38:14 118

原创 【板子】矩阵快速幂

#define ll long long#define MAXN 4#define mod 1000000007struct Matrix{ ll mat[MAXN][MAXN]; Matrix() {} Matrix(ll temp[MAXN][MAXN]) { for (int i = 0; i < MAXN; i++) ...

2020-10-31 10:38:06 51

原创 【板子】树状数组

1、单点修改 区间查询int n;int a[1005],c[1005]; //对应原数组和树状数组int lowbit(int x){ return x&(-x);}void updata(int i,int k){ //在i位置加上k while(i <= n){ c[i] += k; i += lowbit...

2020-10-31 10:38:01 46

原创 【板子】线段树

#include <bits/stdc++.h>using namespace std;const int maxn = 100005;int a[maxn], tree[maxn << 2],lazy[maxn << 2];void Pushup(int node) { //RMQ:tree[node] = max(tree[node &...

2020-10-31 10:37:41 49

原创 CF#1095F Kruskal

F. Make It Connectedtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected graph consisting of nn vertices....

2020-01-04 22:43:45 112

原创 HDU 4463 Prim

OutletsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5015Accepted Submission(s): 2288Problem DescriptionIn China, foreign brand c...

2020-01-04 22:21:36 124

原创 POJ1251 Kruskal

Jungle RoadsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 37996 Accepted: 17888 DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A b...

2020-01-04 22:16:52 96

原创 POJ2387 最短路 Dij+Bellman

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 97437 Accepted: 31547 DescriptionBessie is out in the field and wants to get back to the barn t...

2020-01-04 22:05:06 127

原创 HDU1856 More is better 并查集

More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 39092Accepted Submission(s): 13761Problem DescriptionMr Wang wants ...

2020-01-04 22:04:37 122

原创 HDU 3038 带权并查集

How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23098Accepted Submission(s): 7877Problem DescriptionTT and ...

2020-01-04 22:03:19 83

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除