二分
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
BC 再水水 Guuner
#include #include #include #include #include using namespace std;#define maxn 1000000 + 10int n, m;int h[maxn], q[maxn];map mark;void solve(){ sort(h, h+n); int t; while(m--原创 2015-04-06 13:30:56 · 949 阅读 · 0 评论 -
UVA 4513
题目描述#include #include #include #include using namespace std;#define N 40000 + 10#define x 123typedef unsigned long long LL;int m, len;LL xp[N], H[N];char s[N];LL V[N];LL mark;int po原创 2015-09-18 18:13:02 · 576 阅读 · 0 评论 -
2011 Regular Polygon
题目链接#include #include #include #include #include using namespace std;#define pi acos(-1.0)#define N 100 + 10#define eps 1e-6int n;double a[N];int cmp(double x){ if(fabs(x) < eps)原创 2015-10-02 19:21:41 · 350 阅读 · 0 评论 -
poj 1845
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16666 Accepted: 4164DescriptionConsider two natural numbers A and B. Let S be the sum of all nat原创 2015-09-26 16:48:38 · 476 阅读 · 0 评论 -
codefoeces 567 D
D. One-Dimensional Battle Shipstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob love playing o原创 2015-08-15 23:22:36 · 805 阅读 · 0 评论 -
二分法回顾
二分法(自己写的格外放心)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)原创 2015-06-23 12:09:52 · 798 阅读 · 0 评论 -
POJ 1064 Cable Master
#include #include #include #include #include using namespace std;#define maxn 10000#define eps 1e-8const int INF = 100000;int n, k;double L[maxn];bool judge(double x){ int cnt = 0;原创 2015-04-15 16:05:16 · 524 阅读 · 0 评论 -
POJ 2456 Aggressive cows
#include #include #include #include #include using namespace std;#define maxn 100000int n, m, x[maxn];int Max;bool judge(int d){ int cnt = 1; int a = x[0]; for(int i=1; i<n; i原创 2015-04-15 16:41:18 · 806 阅读 · 0 评论 -
水水就好
#include #include #include #include #include using namespace std;#define maxn 10000#define eps 1e-8struct{ int w, v;}a[maxn];double b[maxn];int n, k;bool cmp(double a, double b)原创 2015-04-15 17:38:50 · 741 阅读 · 0 评论 -
后缀数组第一发---在线文本查询
#include #include #include #include using namespace std;#define N 100000 + 10char 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 <原创 2015-09-22 19:04:46 · 437 阅读 · 0 评论