Codeforces Round #618 (Div. 1) C. Water Balance

Link

Link

Solution

思路就是贪心，让后面的数尽量吸取前面的血量，注意常数

我写了个并查集+$set$

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct UnionFind
{
	ll f[maxn], size[maxn], sum[maxn], mn[maxn], mx[maxn];
	void init(ll n)
	{
		for(auto i=1;i<=n;i++)f[i]=mn[i]=mx[i]=i, size[i]=1;
	}
	ll find(ll x){return f[x]==x?x:f[x]=find(f[x]);}
	void merge(ll x, ll y)
    {
        auto fx=find(x), fy=find(y);
        f[fx]=fy;
        mn[fy]=min(mn[fx],mn[fy]);
        mx[fy]=max(mx[fx],mx[fy]);
        if(fx!=fy)size[fy]+=size[fx], sum[fy]+=sum[fx];
    }
}uf;
ll n, a[maxn], tmp[maxn], lis[maxn];
double getave(ll u)
{
    if(u<1)return -1e100;
    if(u>n)return 1e100;
    ll f=uf.find(u);
    return double(uf.sum[f])/uf.size[f];
}
set<ll> bad;
pll presuf(ll x)
{
    return pll( uf.find(uf.mn[x]-1), uf.find(uf.mx[x]+1) );
}
void update(ll x)
{
    if(x<2 or x>n)return;
    auto pre=presuf(x).first;
    if(getave(x)<getave(pre)+eps)bad.insert(x);
    else bad.erase(x);
}
int main()
{
    ll i, j;
    n=read();
    uf.init(n+1);
    rep(i,1,n)uf.sum[i]=read();
    rep(i,1,n)update(i);
    while(!bad.empty())
    {
        auto x=*bad.rbegin();
        auto pre=presuf(x).first;
        bad.erase(pre), bad.erase(x);
        uf.merge(pre,x);
        auto f=uf.find(x);
        auto pr=presuf(f);
        update(f);
        update(pr.first);
        update(pr.second);
    }
    rep(i,1,n)printf("%.9lf\n",getave(i));
    return 0;
}