Codeforces 939E Maximize! 尺取法/贪心

E. 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

一个结论：答案必然是当前最大的数和之前数列的一个前缀。

证明：如果不取前缀，那么就要空出一些值取后面的数；

此时，用较小的数代替较大的数，平均值减小，显然这时更优。

所以可以用尺取法，每次把这个前缀贪心的向前移一点。复杂度O(n)

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=500005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
ll a[maxn],sum[maxn];

int main() {
	ll n,i,q,m;
	int x;
	n=m=sum[0]=0;
	db ans=0;
	scanf("%I64d",&q);
	for (i=1;i<=q;i++) {
		scanf("%d",&x);
		if (x==1) {
			n++;
			scanf("%I64d",&a[n]);
			sum[n]=sum[n-1]+a[n];
		} else {
			if (n==1) ans=0; else ans=(db)a[n]-(db)(sum[m]+a[n])/(db)(m+1);
			while (m+1<n&&(db)a[n]-(db)(sum[m+1]+a[n])/(db)(m+2)>ans) {
				ans=(db)a[n]-(db)(sum[m+1]+a[n])/(db)(m+2);
				m++;
			}
			printf("%.10lf\n",ans);
		}
	}
	return 0;
}