小橙子yoo的博客

A. Expressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya studies in a school and he adores Maths. His class has been studying arithm...

A. Kefa and First Stepstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa decided to make some money doing business on the Internet for exa...

A. Presentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Petya very much likes gifts. Recently he has received a new laptop as a New...

The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a litt...

F2. Microtransactions (hard version)time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe only difference between easy and hard versions is con...

题意：输入一个数组，经过不同的操作后再按原来的顺序输出这个数组。操作1：将第x个数换成y操作2：将所有小于x的数换成x思路：如果每次都实现操作2的步骤肯定会Tle，所有我们要对每次的操作2进行处理。具体怎么实现呢？我是用一个idx来记录进行了第几次2操作了，然后用last[i]=idx来记录最近修改第i个数值的时候已经进行了多少次的2操作了。用p[i]来记录第i次p操作将所有的数修改成什...

这道题我看题意看半天，一看懂就很简单了。题意：首先有n个数，K表示n个数中不同的个数（比如说3个数1 2 3则K=3，1 2 2则K=2）这K个数需要k bits(k=log2K)，存这些数要nk bits空间。现在给你一个I byte大小的磁盘来装这n个数（其实就是8I bits大小）使得这些数在区间[ l , r ]上，小于l的数全改成l，大于r的数全改成l，最少要修改多少个数。思...

很简单的数学题没啥好说的…下面是AC代码