蓝桥杯算法总结
1)归并排序:#include<bits/stdc++.h>#define ll long longconst ll nl=1e5+5;using namespace std;ll n;ll a[nl];ll q[nl];void f(ll l,ll r){ if(l>=r){ return; } ll mid; mid=(l+r)/2; f(l,mid); f(mid+1,r); ll i=l,j=mid+1,k=0; while(i<=mid&
原创
2022-04-07 11:15:25 ·
1099 阅读 ·
0 评论