Dikea's Blog

#include #include #include #include #include using namespace std; #define maxn 1000000 + 10 int n, m; int h[maxn], q[maxn]; map mark; void solve() { sort(h, h+n); int t; while(m--

题目描述 #include #include #include #include using namespace std; #define N 40000 + 10 #define x 123 typedef unsigned long long LL; int m, len; LL xp[N], H[N]; char s[N]; LL V[N]; LL mark; int po

题目链接 #include #include #include #include #include using namespace std; #define pi acos(-1.0) #define N 100 + 10 #define eps 1e-6 int n; double a[N]; int cmp(double x) { if(fabs(x) < eps)

Sumdiv Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 16666   Accepted: 4164 Description Consider two natural numbers A and B. Let S be the sum of all nat

D. One-Dimensional Battle Ships time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alice and Bob love playing o

二分法(自己写的格外放心) 1.lower_bound 注意要是查找一个数组的话 应该从(-1, n)的范围内查找  r表示出现的最小位置 void solve(int l, int r)///(l,r]{ while(l + 1 r) { int mid = (l + r) >> 1; if(a[mid] >= k)

#include #include #include #include #include using namespace std; #define maxn 10000 #define eps 1e-8 const int INF = 100000; int n, k; double L[maxn]; bool judge(double x) { int cnt = 0;

#include #include #include #include #include using namespace std; #define maxn 100000 int n, m, x[maxn]; int Max; bool judge(int d) { int cnt = 1; int a = x[0]; for(int i=1; i<n; i

#include #include #include #include #include using namespace std; #define maxn 10000 #define eps 1e-8 struct { int w, v; }a[maxn]; double b[maxn]; int n, k; bool cmp(double a, double b)

#include #include #include #include using namespace std; #define N 100000 + 10 char s[N]; int sa[N], t[N], t2[N], c[N], n; void build_sa(int m) { int i, *x = t, *y = t2; for( i = 0; i <