#include<iostream>using namespace std;const int N=1e5+10;int n,m,a[N],b[N];int main(){ cin>>n>>m; for(int i=0;i<n;i++)cin&g
Published on 2022-01-05
#include<iostream>using namespace std;const int N=1e5+10;int a[N],b[N],n,m,x;int main(){ cin>>n>>m>>x; for(int i=0;i<
Published on 2022-01-05
'''cpp#includeusing namespace std;const int N =1e5+10;int a[N],s[N];int n;int main(){cin>>n;int ans=0;for(int i=0,j=0;i<n;i++){cin>>a[i
Published on 2022-01-05
Floyd求最短路径原题链接#include<iostream>#include<cstring>using namespace std;const int N=210,M=20010,INF=0x3f3f3f3f;int g[N][N];int n,m,Q;int main
Published on 2021-09-14
Prim算法求最小生成树代码#include<iostream>#include<algorithm>#include <cstring>using namespace std;const int N=510,M=1e5+10,INF=0x3f3f3f3f;int
Published on 2021-09-14
第一种http://www.360doc.com/content/14/0107/14/13084517_343312854.shtml第二种http://doc.ewomail.com/docs/ewomail/jianjie
Published on 2021-07-20
#include<iostream>#include<vector>#include<algorithm>using namespace std;typedef pair<int ,int> PII;vector<PII>regs;int
Published on 2021-06-04
其实就是先将每个位置的坐标x和其加的值c存为PII,然后再将每个位置x单独存为一个集合alls，通过去重，排序，得到一个有序的数组用find函数找到每个x的下标位置，再用前缀和将每个位置x的c值加起来#include<iostream>#include<vector>#inc
Published on 2021-06-03
Acwing算法总结算法基础快速排序算法模板void quick_sort(int q[], int l, int r){if (l >= r) return;int i = l - 1, j = r + 1, x = q[l + r >> 1];while (i < j){
Published on 2021-05-04
-ca9fe781c2d244deaabd5ebe8c1c61a1.JPG)
