weixin_46204099的博客

校门外有很多树，学校决定在某个时刻在某一段种上一种树，保证任一时刻不会出现两段相同种类的树，现有两种操作： K=1，读入l,r表示在l到 r之间种上一种树，每次操作种的树的种类都不同； K=2，读入 l,r表示询问 l到 r之间有多少种树。 注意：每个位置都可以重复种树。 输入格式 第一行表示道路总长为 n，共有m个操作； 接下来 m行为 m个操作。 输出格式 对于每个 K=2输出一个答案。 样例 样例输入 5 4 1 1 3 2 2 5 1 2 4 2 3 ...

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence 9 1 0 5 4 , .

In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length. Now Pudge wants to do some operations on the hook. Let us numb..

You haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval. Input The first li...

For the daily milking, Farmer John'sNcows (1 ≤N≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things simple, he will take a contiguous range of cows from the...