cyd2014

摘要： RGCDQTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 323Accepted Submission(s): 162Problem Descrip... 阅读全文

摘要： -Error CurvesTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionJosephina is a clever girl and addicted to Machi... 阅读全文

摘要： C -Equation AgainTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThis problem’s author is too lazy to write t... 阅读全文

摘要： Monthly ExpenseTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John is an astounding accounting wizard... 阅读全文

摘要： Hamburgers Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Hamburgers Submit Status Description Polycarpus loves h 阅读全文

摘要： BuildingsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 221Accepted Submission(s): 29Problem De... 阅读全文

摘要： Piotr's AntsTime Limit: 2 seconds"One thing is for certain: there is no stopping them;the ants will soon be here. And I, for one, welcome ournew insec... 阅读全文

摘要： Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1316Accepted Submission(s): 641Problem Description... 阅读全文

摘要： 算法的一个实现方法如下。其中使用位运算替代2的幂次的计算，加快运算速度。使用时需要先调用initRMQ()进行初始化，然后再调用RMQ(u,v)进行查询。 1 const int mx = 10000 + 10; //数组最大长度 2 int n, a[mx]; //数组长度，数组内容 3 4 ... 阅读全文

摘要： 1 #include 2 3 int binsearch(int x,int a[],int n) 4 { 5 int low,high,mid; 6 7 low=0,high=n-1; 8 9 while(lowa[mid]){16 low=... 阅读全文