CF 314A(Sereja and Contest-这题题目索性没看懂,E文是硬伤)

C. Sereja and Contest

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

During the last Sereja's Codesecrof round the server crashed many times, so the round was decided to be made unrated for some participants.

Let's assume that n people took part in the contest. Let's assume that the participant who got the first place has rating a₁, the second place participant has rating a₂, ..., the n-th place participant has rating a_n. Then changing the rating on the Codesecrof site is calculated by the formula .

After the round was over, the Codesecrof management published the participants' results table. They decided that if for a participant d_i < k, then the round can be considered unrated for him. But imagine the management's surprise when they found out that the participants' rating table is dynamic. In other words, when some participant is removed from the rating, he is removed from the results' table and the rating is recalculated according to the new table. And of course, all applications for exclusion from the rating are considered in view of the current table.

We know that among all the applications for exclusion from the rating the first application to consider is from the participant with the best rank (the rank with the minimum number), for who d_i < k. We also know that the applications for exclusion from rating were submitted by all participants.

Now Sereja wonders, what is the number of participants to be excluded from the contest rating, and the numbers of the participants in the original table in the order of their exclusion from the rating. Pay attention to the analysis of the first test case for a better understanding of the statement.

Input

The first line contains two integers n, k (1 ≤ n ≤ 2·10⁵,  - 10⁹ ≤ k ≤ 0). The second line contains n space-separated integersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — ratings of the participants in the initial table.

Output

Print the numbers of participants in the order in which they were removed from the table. Print the initial numbers of the participants, that is, the numbers that the participants had in the initial table.

Sample test(s)

input

5 0
5 3 4 1 2

output

2
3
4

input

10 -10
5 5 1 7 5 1 2 4 9 2

output

2
4
5
7
8
9

Note

Consider the first test sample.

• Initially the sequence of the contest participants' ratings equals [5, 3, 4, 1, 2]. You can use this sequence to calculate the sequence of rating changes: [0, -9, -13, 8, 14]. According to the problem statement, the application of the participant who won the second place will be considered first.

• As soon as the second place winner is out from the ratings, the participants' rating sequence will equal [5, 4, 1, 2]. By this sequence you can count the new sequence of rating changes: [0, -8, 2, 6]. According to the problem statement, the application of the participant who won the second place will be considered. Initially this participant won third place.

• The new rating sequence equals [5, 1, 2], the new sequence of rating changes equals [0, -1, 1]. The second place participant's application is taken into consideration, initially this participant won the fourth place.

• The new rating sequence equals [5, 2], the new sequence of rating changes equals [0, 0]. No more applications will be considered.

  Thus, you should print 2, 3, 4.

完全看不懂题.

以为要动态维护，不断循环，直到无法Unrated

事实上，本题的意思是

从头到尾进行删除，删除可能改变表中数据，问最后谁会Unrated

注意只要扫1遍……赤裸裸的模拟……

E文太差伤不起

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define MAXN (200000+10)
long long n,k,a[MAXN];
int main()
{
    cin>>n>>k;
    long long tmp=0;
    int j=1;
    For(i,n)
    {
        long long a;
        cin>>a;
        if (tmp-(i-1)*(n-i)*a<k)
        {
            cout<<j<<endl;
            n--;i--;
        }
        else tmp+=a*(i-1);

        j++;
    }
	return 0;
}