__小明003的博客

Rescue Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20225    Accepted Submission(s): 7223 Problem Description Angel was caught by th

Pie Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5660    Accepted Submission(s): 2191 Problem Description My birthday is coming up a

Queue Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 497    Accepted Submission(s): 266 Problem Description N people numbere

题目：http://hihocoder.com/problemset/problem/1269 //主要就是二分查找 以q 为界限 #include using namespace std; long long n,m; int a[100005]; priority_queueq; long long Find(int len) { while(!q.empty())

链接：  http://codeforces.com/problemset/problem/551/C          思路：二分查找所需的时间t，m个人都有t个单位的时间，从后往前清空，直到答案最优 #include using namespace std; #define ll long long int a[100005],b[100005]; int main() { in

链接：http://codeforces.com/problemset/problem/689/C #include using namespace std; #define ll long long ll get(ll n) { ll ans=0; for(ll k=2;k*k*k<=n;k++) ans+=n/(k*k*k); return

链接：http://codeforces.com/problemset/problem/689/D #include using namespace std; #define ll long long const int maxn=2e5+10; struct tree { int l,r; int a,b,ma,mi; }tree[3*maxn]; int a[max