07 2020 档案
摘要：#include<algorithm> #include<iostream> #include<cstdlib> #include<cstring> #include<cctype> #include<cstdio> #include<vector> #include<string> #includ
阅读全文
posted @ 2020-07-26 12:59
晴屿
摘要：#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
posted @ 2020-07-03 14:58
晴屿
摘要：#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
posted @ 2020-07-03 14:41
晴屿
摘要：参考：https://www.luogu.com.cn/blog/RPdreamer/p2051 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #
阅读全文
posted @ 2020-07-03 13:55
晴屿
摘要：E1 #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<map> using namespace std; #define int long long const int N=1e6+
阅读全文
posted @ 2020-07-02 10:08
晴屿
摘要：#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; #define int long long int mp[410][410]; void solve() {
阅读全文
posted @ 2020-07-02 10:06
晴屿
摘要：#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int N=6e6+10; #define int long long int e[N],h[N]
阅读全文
posted @ 2020-07-02 10:02
晴屿
摘要：#include <bits/stdc++.h> using namespace std; const int maxn=1e2+1; char a[maxn][maxn]; int r[maxn],c[maxn];//r是行，c是列 int T; void solve() { int n,m,fl
阅读全文
posted @ 2020-07-02 10:01
晴屿
浙公网安备 33010602011771号