萧魂不散

摘要： 转载自：https://www.cnblogs.com/luoxn28/p/5767571.html 1 二分查找 二分查找是一个基础的算法，也是面试中常考的一个知识点。二分查找就是将查找的键和子数组的中间键作比较，如果被查找的键小于中间键，就在左子数组继续查找；如果大于中间键，就在右子数组中查找， 阅读全文

摘要： Enough with this Harry Potter, please! What are we, twelve-year olds? Let's get our teeth into some real pumpkin pasties -- oops, programming problems 阅读全文

摘要： George met AbdelKader in the corridor of the CS department busy trying to fix a group of incorrect equations. Seeing how fast he is, George decided to 阅读全文

摘要： Thanks a lot for helping Harry Potter in finding the Sorcerer's Stone of Immortality in October. Did we not tell you that it was just an online game ? 阅读全文

摘要： 转载自：https://blog.csdn.net/yuehailin/article/details/68961304 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。 首先考虑下如何将将二个有序数列合并。这个非常简单 阅读全文

摘要： D. Coins and Queries time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Polycarp has nn coi 阅读全文

摘要： 题目链接：http://codeforces.com/gym/100989/problem/D In this cafeteria, the N tables are all ordered in one line, where table number 1 is the closest to th 阅读全文

摘要： 转载自：https://blog.csdn.net/qingyuanluofeng/article/details/47159193 阅读全文

摘要： Blue Jeans Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20163 Accepted: 8948 Description The Genographic Project is a research partnersh 阅读全文

摘要： A. Finite or not? time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given several q 阅读全文