06 2020 档案

摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-29 22:51 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-28 16:59 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-28 10:27 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-28 10:26 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-28 10:25 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<iostream> using namespace std; const int maxn=200010; const double eps 阅读全文
posted @ 2020-06-25 18:15 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #define N 200005 using namespace std; #define int long long int n,m,S,T,tmp1,tmp2,tot; int id 阅读全文
posted @ 2020-06-25 11:46 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-24 21:46 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-24 21:45 晴屿 编辑
摘要:比赛的时候wa吐了 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #includ 阅读全文
posted @ 2020-06-24 21:41 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<iostream> using namespace std; const int maxn=1e6+10; const int inf=0x 阅读全文
posted @ 2020-06-24 11:17 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<iostream> using namespace std; const int maxn=200010; #define int long 阅读全文
posted @ 2020-06-23 13:55 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<iostream> using namespace std; const int maxn=100010; bool vis[maxn]; 阅读全文
posted @ 2020-06-22 22:26 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; const int maxn=100010; bool vis[maxn]; int n,m,s,t,x,y,z,f 阅读全文
posted @ 2020-06-22 18:52 晴屿 编辑
摘要:#include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<iostream> using namespace std; const int maxn=100010; bool vis[maxn]; 阅读全文
posted @ 2020-06-22 18:50 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 6000666 using namespace std; const int inf=(1 << 26); int n,m,S,T, 阅读全文
posted @ 2020-06-22 17:40 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 2000005 #define p(a,b) (a-1)*m+b #define q(a,b) p(a,b)+n*m using n 阅读全文
posted @ 2020-06-22 17:06 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 2000005 using namespace std; const int inf=(1 << 28); int n,m,S,T, 阅读全文
posted @ 2020-06-21 22:34 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 2000005 using namespace std; const int inf=1000000007; int n,m,S,T 阅读全文
posted @ 2020-06-21 18:16 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 2000005 using namespace std; const int inf=1000000007; int n,m,S,T 阅读全文
posted @ 2020-06-21 17:55 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:09 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:07 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:06 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:04 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:03 晴屿 编辑
摘要:#pragma GCC optimize(2) #include<bits/stdc++.h> #define ll long long #define maxn 1000005 #define inf 1e9 #define pb push_back #define rep(i,a,b) for( 阅读全文
posted @ 2020-06-21 12:01 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-21 12:00 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #define N 500000 using namespace std; int n,m,S,T,tmp1,tmp2,tot; int idx,hea 阅读全文
posted @ 2020-06-20 17:06 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #define N 500000 using namespace std; int n,m,S,T,tmp1,tmp2,tot; int idx,head[N],cur[N],q[N], 阅读全文
posted @ 2020-06-20 16:28 晴屿 编辑
摘要:#include <iostream> #include <cstdio> #include <cstring> #define N 100010 using namespace std; int n,m,S,T,tmp1,tmp2,tot; int idx,head[N],cur[N],q[N], 阅读全文
posted @ 2020-06-20 11:47 晴屿 编辑
摘要:匈牙利: #include<iostream> #include<cstdio> #include<algorithm> #include<queue> #include<iomanip> #include<cstring> using namespace std; typedef long lon 阅读全文
posted @ 2020-06-20 10:09 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-14 11:33 晴屿 编辑
摘要:#include<bits/stdc++.h> #define ls rt<<1 #define rs rt<<1|1 using namespace std; typedef long long ll; const int p=1e8+7; int ans1; int ans2; int ans3 阅读全文
posted @ 2020-06-14 11:30 晴屿 编辑
摘要:#include<bits/stdc++.h> #define ls rt<<1 #define rs rt<<1|1 using namespace std; typedef long long ll; const int p=1e8+7; vector<int>v[1001000],ans; i 阅读全文
posted @ 2020-06-14 11:29 晴屿 编辑
摘要:参考博客:https://www.cnblogs.com/heyuhhh/p/13099217.html 赛中让我发代一小时的题,赛后还是要看题解 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<c 阅读全文
posted @ 2020-06-12 22:01 晴屿 编辑
摘要:对应位置的数字之间的关系是不变的,直接利用这一点就可以做开始还写了ida*,结果t飞了 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #inclu 阅读全文
posted @ 2020-06-12 21:46 晴屿 编辑
摘要:自己动手模拟一下就好,最多三个数 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> 阅读全文
posted @ 2020-06-12 21:43 晴屿 编辑
摘要:#pragma GCC optimize(2) #include<bits/stdc++.h> #define ll long long #define maxn 1000005 #define inf 1e9 #define pb push_back #define rep(i,a,b) for( 阅读全文
posted @ 2020-06-12 21:38 晴屿 编辑
摘要:#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<cmath> #include<map> #include<vector> #include<queue> #include<set> 阅读全文
posted @ 2020-06-12 21:32 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-04 16:15 晴屿 编辑
摘要:#include<cstdio> #include<iostream> using namespace std; typedef long long ll; const int N=2e6+5; ll q[N]; ll sum[N],a[N],n,p,d; ll l,r;//维护区间 ll hh,t 阅读全文
posted @ 2020-06-04 13:52 晴屿 编辑
摘要:#include<cstdio> #include<queue> #include<cstring> #include<cmath> #include<iostream> #define mod 9987 using namespace std; const int N=1000005; int e 阅读全文
posted @ 2020-06-04 00:45 晴屿 编辑
摘要:#include<iostream> #include<cstdio> #include<algorithm> #include<queue> #include<iomanip> #include<cstring> using namespace std; typedef long long ll; 阅读全文
posted @ 2020-06-04 00:28 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-04 00:16 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-03 13:11 晴屿 编辑
摘要:#include <cstdio> #include <iostream> using namespace std; int n,m,x; int hh,tt,a[1000001],q[1000001],f[1000001]; int read() { char ch=getchar(); int 阅读全文
posted @ 2020-06-03 13:10 晴屿 编辑
摘要:#include<bits/stdc++.h> #pragma GCC optimize(3) using namespace std; const int N=1009,M=100009; int n,m,ans,ord,q[M],pre[N]; int ql,qr,dfn[N],lk[N]; i 阅读全文
posted @ 2020-06-02 23:50 晴屿 编辑
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> # 阅读全文
posted @ 2020-06-01 19:21 晴屿 编辑
摘要:#pragma GCC optimize(2) #include<bits/stdc++.h> #define ll long long #define maxn 1000005 #define inf 2e9 using namespace std; inline int read() { int 阅读全文
posted @ 2020-06-01 19:19 晴屿 编辑
摘要:#include<bits/stdc++.h> const int N=100+10; const int T=5000; using namespace std; int n,t,k,ans; int v[N],h[N],f[T]; int now; //如果不考虑大的,x=t-h[i] //考虑 阅读全文
posted @ 2020-06-01 19:16 晴屿 编辑

点击右上角即可分享
微信分享提示