welcome to 浩·C's blog

The Frog's Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 7263    Accepted Submission(s): 3482 Problem Description The annua

//有n个物品的重量和价值分别是Wi和Vi.从中选出k个物品使得单位重量的价值最大 bool judge(double mid) { vector vec; for(int i=0;i<N;++i) vec.push_back(v[i]-w[i]*mid); sort(vec.begin(),vec.end()); double sum=0; for(int i=0;i<K;++i)

代码： //给定长度为n的单调不下降数列A0,A1,...,An-1和一个数k，求满足Ai>=k条件的最小的i。不存在的情况下输出n void solve() { int a=-1,b=n; while(b-a>1) //(,]，左开右闭区间 { int mid=a+(b-a)/2; if(A[mid]>=k) b=mid; else a=mid; } prin

Aggressive cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 14152   Accepted: 6853 Description Farmer John has built a new long barn, with N (2 His