摘要： Domino EffectTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5539Accepted: 1396DescriptionDid you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes and build a row by standing them on end with only a small distance in between. If you do 阅读全文

摘要： Til the Cows Come HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 21302Accepted: 7090DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants 阅读全文

摘要： Mayor's postersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 27702Accepted: 8001DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has fin 阅读全文

摘要： /* 功能Function Description: BOJ 1257 Jim 和 Tradia的故事II-第K小数---初学线段树 开发环境Environment: DEV C++ 4.9.9.1 技术特点Technique: 版本Version: 作者Author: 可笑痴狂 日期Date: 20120807 备注Notes: Description Tradia对数据结构很感兴趣，她懂得很多有用的数据结构，比如链表、二叉树、图等等。最近她在学习堆的有关知识，并对... 阅读全文

摘要： 士兵杀敌（四）时间限制：2000 ms | 内存限制：65535 KB难度：5描述南将军麾下有百万精兵，现已知共有M个士兵，编号为1~M，每次有任务的时候，总会有一批编号连在一起人请战（编号相近的人经常在一块，相互之间比较熟悉），最终他们获得的军功，也将会平分到每个人身上，这样，有时候，计算他们中的哪一个人到底有多少军功就是一个比较困难的事情，军师小工的任务就是在南将军询问他某个人的军功的时候，快速的报出此人的军功，请你编写一个程序来帮助小工吧。假设起始时所有人的军功都是0.输入只有一组测试数据。每一行是两个整数T和M表示共有T条指令，M个士兵。（1<=T,M<=1000000)随 阅读全文