小坏蛋_千千

给定长度为N的字符串S，构造一个长度为N的字符串T，并且每次只能对S的首尾字符进行操作，目标是使得构造出的T的字典序尽可能小。还算简单的贪心问题吧！只要确定好贪心策略，就没有什么问题啦~

Description DreamGrid has a nonnegative integer nn. He would like to divide nn into mm nonnegative integers a1,a2,…,ama_1, a_2, \dots, a_m and minimizes their bitwise or (i.e. n=a1+a2+⋯+amn=a_1 + a_2

Description You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each

Description Steph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too easy for s

Description Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side of the sea to get the Iron Throne. Sh

Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z into each numbe

Problem Description snow 是个热爱打字的家伙，每次敲出更快的速度都会让他很开心。现在，他拿到一篇新的打字文章，已知这篇文章只有 26 个小写英文字母，给出 snow 打出这 26 个英文字母分别需要多少时间 (s)，问 snow 打完这篇文章获得的 kpm（打正确的字数/所花的分钟数）最大为多少？ 注意 snow 可能会打错一些字哦。打错的必定是文章里面存在的。

Problem Description There are n kinds of goods in the company, with each of them has a inventory of cnti and direct unit benefit vali. Now you find due to price changes, for any goods sold on day i,

Problem Description LYD loves codeforces since there are many Russian contests. In an contest lasting for T minutes there are n problems, and for the ith problem you can get ai−di∗ti points, where ai

Description Oleg the client and Igor the analyst are good friends. However, sometimes they argue over little things. Recently, they started a new company, but they are having trouble finding a name f

Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, loc

Pick applesTime Limit: 1000MS Memory limit: 165536K题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a

Description A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs. Catacombs consist o