Alice likes snow a lot! Unfortunately, this year's winter is already over, and she can't expect to have any more of it. Bob has thus bought her a gift — a large snow maker. He plans to make some amount of snow every day. On day i he will make a pile of snow of volume Vi and put it in her garden.
Each day, every pile will shrink a little due to melting. More precisely, when the temperature on a given day is Ti, each pile will reduce its volume by Ti. If this would reduce the volume of a pile to or below zero, it disappears forever. All snow piles are independent of each other.
Note that the pile made on day i already loses part of its volume on the same day. In an extreme case, this may mean that there are no piles left at the end of a particular day.
You are given the initial pile sizes and the temperature on each day. Determine the total volume of snow melted on each day.
The first line contains a single integer N (1 ≤ N ≤ 105) — the number of days.
The second line contains N integers V1, V2, ..., VN (0 ≤ Vi ≤ 109), where Vi is the initial size of a snow pile made on the day i.
The third line contains N integers T1, T2, ..., TN (0 ≤ Ti ≤ 109), where Ti is the temperature on the day i.
Output a single line with N integers, where the i-th integer represents the total volume of snow melted on day i.
3 10 10 5 5 7 2
5 12 4
5 30 25 20 15 10 9 10 12 4 13
9 20 35 11 25
In the first sample, Bob first makes a snow pile of volume 10, which melts to the size of 5 on the same day. On the second day, he makes another pile of size 10. Since it is a bit warmer than the day before, the first pile disappears completely while the second pile shrinks to 3. At the end of the second day, he has only a single pile of size 3. On the third day he makes a smaller pile than usual, but as the temperature dropped too, both piles survive till the end of the day.
题意:每天堆一个v单位的雪人,每天都有一个大于0的温度t,堆好的所有雪人都会融化t个单位,问你每天融化的单位有多少。
题解:比赛时想到用线段树或者树状数组维护融化的区间值,一直到最后也没写出来,后来写了个暴力,果断T了。
下面的代码是用优先队列维护当前天之前雪人的体积。
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;
typedef long long ll;
priority_queue<ll,vector<ll>,greater<ll> >q;
ll a[1000010],b[1000005],sum[1000005],t[1000005];
int main()
{
ll n;cin>>n;
for(ll i=1;i<=n;i++)
{
cin>>a[i];
}
for(ll i=1;i<=n;i++)
{
cin>>t[i];sum[i]=t[i]+sum[i-1];
}
for(ll i=1;i<=n;i++)
{
ll ans=0;q.push(a[i]+sum[i-1]);
while(!q.empty()&&q.top()<=sum[i])
{
ans+=q.top()-sum[i-1];
q.pop();
//cout<<q.size()<<endl;
}
ans+=ll(q.size()*t[i]);
if(i!=1) printf(" %lld",ans);
else printf("%lld",ans);
}
return 0;
}