随笔分类 -  二分三分

ural 1058 chocolate
摘要：Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1058DescriptionFishburg confectionery factory produces conv... 阅读全文
posted @ 2015-08-01 14:02 cyd2014 阅读(239) 评论(0) 推荐(0)
三分 例题
摘要：K -例题4Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2420Description给出平面上N（ 2 #include 3 const double inf... 阅读全文
posted @ 2015-08-01 09:56 cyd2014 阅读(250) 评论(0) 推荐(0)
二分 例题3
摘要：Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4932DescriptionThere are N point on X-axis . Miaomiao would ... 阅读全文
posted @ 2015-08-01 09:55 cyd2014 阅读(217) 评论(0) 推荐(0)
二分 例题2
摘要：Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2456DescriptionFarmer John has built a new long barn, with N... 阅读全文
posted @ 2015-08-01 09:53 cyd2014 阅读(305) 评论(0) 推荐(0)
二分 例题1
摘要：Time Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1064DescriptionInhabitants of the Wonderland have decided to... 阅读全文
posted @ 2015-08-01 09:52 cyd2014 阅读(222) 评论(0) 推荐(0)
Can you find it?
摘要：Can you find it?Time Limit:3000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2141DescriptionGive you three sequences of n... 阅读全文
posted @ 2015-08-01 09:51 cyd2014 阅读(229) 评论(0) 推荐(0)
POJ 3258 River Hopscotch
摘要：Time Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3258DescriptionEvery year the cows hold an event featuring a... 阅读全文
posted @ 2015-08-01 09:50 cyd2014 阅读(138) 评论(0) 推荐(0)
Cup HDU 2289
摘要：The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?The r... 阅读全文
posted @ 2015-08-01 09:49 cyd2014 阅读(147) 评论(0) 推荐(0)
三分 Error Curves
摘要：-Error CurvesTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionJosephina is a clever girl and addicted to Machi... 阅读全文
posted @ 2015-07-28 09:26 cyd2014 阅读(187) 评论(0) 推荐(0)
Equation Again 最大化最小值
摘要：C -Equation AgainTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThis problem’s author is too lazy to write t... 阅读全文
posted @ 2015-07-27 21:38 cyd2014 阅读(206) 评论(0) 推荐(0)
Monthly Expense
摘要：Monthly ExpenseTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionFarmer John is an astounding accounting wizard... 阅读全文
posted @ 2015-07-27 21:37 cyd2014 阅读(218) 评论(0) 推荐(0)
Hamburgers 假定解是否可行
摘要：Hamburgers Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Hamburgers Submit Status Description Polycarpus loves h 阅读全文
posted @ 2015-07-27 21:36 cyd2014 阅读(203) 评论(0) 推荐(0)
二分法
摘要：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=... 阅读全文
posted @ 2015-07-21 21:27 cyd2014 阅读(121) 评论(0) 推荐(0)