码迷,mamicode.com
首页 >  
搜索关键字:who    ( 2492个结果
poj 2886 Who Gets the Most Candies?
Problem: 2886 User: shu_dayangMemory: 11104K Time: 1125MSLanguage: C++ Result: Accepted#include#include#include#define MID(a,b) ((a + b) >> 1)usin...
分类:其他好文   时间:2015-07-21 23:52:54    阅读次数:165
pat1006. Sign In and Sign Out (25)
1006. Sign In and Sign Out (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueAt the beginning of every day, the first person who signs in ...
分类:其他好文   时间:2015-07-21 10:27:25    阅读次数:96
[LeetCode] Search in Rotated Sorted Array II
For those who have already solvedSearch in Rotated Sorted Array, this problem can be solved similarly using codes for that problem and simply adding c...
分类:其他好文   时间:2015-07-19 14:50:19    阅读次数:82
HDU4649:Professor Tian(概率)
Problem Description Timer took the Probability and Mathematical Statistics course in the 2012, But his bad attendance angered Professor Tian who is in charge of the course. Therefore, Professor Tia...
分类:其他好文   时间:2015-07-17 18:58:22    阅读次数:121
Acdream 1115——找规律——Salmon And Cat
Math is very important, for those who are also in school, make sure you will learn more about math.Salmon and Cat are good friends.Today Salmon ask Ca...
分类:其他好文   时间:2015-07-15 22:41:15    阅读次数:216
POJ 2886 Who Gets the Most Candies?(线段树·约瑟夫环)
题意  n个人顺时针围成一圈玩约瑟夫游戏  每个人手上有一个数val[i]   开始第k个人出队  若val[k] 0 时向左数val[k]个  第m出队的人可以得到m的约数个数个糖果  问得到最多糖果的人是谁 约瑟夫环问题  n比较大 直接模拟会超时   通过线段树可以让每次出队在O(logN)时间内完成  类似上一道插队的题  线段树维护对应区间还有多少个人没出队  那么当我们知道出队的人...
分类:其他好文   时间:2015-07-13 22:34:13    阅读次数:237
Maximum number of WAL files in the pg_xlog directory (2)
Jeff Janes:Hi,As part of our monitoring work for our customers, we stumbled upon an issue with our customers' servers who have a wal_keep_segments set...
分类:其他好文   时间:2015-07-13 00:45:29    阅读次数:201
Maximum number of WAL files in the pg_xlog directory (1)
Guillaume Lelarge:Hi,As part of our monitoring work for our customers, we stumbled upon an issue with our customers' servers who have a wal_keep_segme...
分类:其他好文   时间:2015-07-13 00:34:45    阅读次数:201
【概率】poj 2096:Collecting Bugs
Description Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When I....
分类:其他好文   时间:2015-07-11 22:50:57    阅读次数:158
poj2886--Who Gets the Most Candies?(线段树+反素数)
题目链接点击打开链接 题目大意:给出n个人的姓名和手里的一个号码,n个人排成一圈,号码有正有负,代表着正向还是反向移动k个位置,比赛从第k个人开始,把被选到的人踢出,问按踢出的顺序中因子数最多的是谁? 建立线段树,把n个人被踢的顺序找到,然后求出n个人中因子数最多的(最小的数)是谁,这里要用到反素数,详看链接点击打开链接 #include #include #include using...
分类:其他好文   时间:2015-07-11 12:15:23    阅读次数:105
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!