CodeForces - 939E Maximize! （三分搜索）

Maximize!

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a multiset S consisting of positive integers (initially empty). There are two kind of queries:

1. Add a positive integer to S, the newly added integer is not less than any number in it.
2. Find a subset s of the set S such that the value  is maximum possible. Here max(s) means maximum value of elements in s,  — the average value of numbers in s. Output this maximum possible value of .

Input

The first line contains a single integer Q (1 ≤ Q ≤ 5·105) — the number of queries.

Each of the next Q lines contains a description of query. For queries of type 1 two integers 1 and x are given, where x (1 ≤ x ≤ 109) is a number that you should add to S. It's guaranteed that x is not less than any number in S. For queries of type 2, a single integer 2 is given.

It's guaranteed that the first query has type 1, i. e. S is not empty when a query of type 2 comes.

Output

Output the answer for each query of the second type in the order these queries are given in input. Each number should be printed in separate line.

Your answer is considered correct, if each of your answers has absolute or relative error not greater than 10 - 6.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if .

Examples

input

Copy

6
1 3
2
1 4
2
1 8
2

output

0.0000000000
0.5000000000
3.0000000000

input

Copy

4
1 1
1 4
1 5
2

output

2.0000000000

解题思路：很容易想到，最大值肯定是用当前s的最大值减去某个从前往后取的子集。想是想到了，但是不会……因为没学过三分搜索。这里顺便学习了三分搜索，学会了就很简单了！推荐：https://blog.csdn.net/u011787119/article/details/44598871

边缘条件要注意。

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;

const int MOD=1e9+7;

double s[500005];

int cnt;

double sum[500005];

double judge(int x,int m){

    return s[m]-(sum[x]+s[m])/(x+1);

}

int tri_search(int N){

    int ml,mr;

    int l=1,r=N-1;

    while(l+1<r){

        ml=(l+r)/2;

        mr=(ml+r)/2;

        if(judge(ml,N)>=judge(mr,N))

            r=mr;

        else

            l=ml;

    }

    if(judge(l,N)>judge(r,N))//边缘情况

            return l;

        else

            return r;

}

int main()

{

    int Q;

    scanf("%d",&Q);

    cnt=0;

    int a,b;

    while(Q--){

        scanf("%d",&a);

        if(a==1){

            scanf("%d",&b);

            cnt++;

            s[cnt]=b;

            sum[cnt]=sum[cnt-1]+s[cnt];

        }

        else{

            if(cnt==1){

                printf("%.10lf\n",0.0);

            }

            else

                if(cnt==2){

                    printf("%.10lf\n",s[2]-(sum[1]+s[2])/(2));

                }

                else{

                    if(cnt==3){

                        double one=s[3]-(sum[1]+s[2]+s[3])/(3);

                        double two=s[3]-(sum[1]+s[3])/(2);

                        printf("%.10lf\n",max(one,two));

                    }

                    else{

                        int index=tri_search(cnt);

                        printf("%.10lf\n",s[cnt]-(sum[index]+s[cnt])/(index+1));

                    }

                }

        }

    }

    return 0;

}