#include<iostream> #include<vector> #include<algorithm> #define ft first #define sd second #define pb push_back using namespace std; typedef long long ll; struct cut{ ll t, h, pos; cut(ll t, ll h, ll pos) : t(t), h(h), pos(pos) {} }; const ll N = 1000000; ll n, m; ll a[N],suf[N]; ll tajm, hi, res; vector<cut> cuts; int main(){ cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+n+1); for(int i=n;i>=0;i--) suf[i]=suf[i+1]+a[i]; cuts.push_back(cut(0,0,0)); for(int i=0;i<m;i++){ // cout<<i<<" "; cin>>tajm>>hi; ll j=cuts.size()-1; ll last = n + 1; ll wyn = 0; ll dt; while(1){ dt = tajm - cuts[j].t; if(cuts[j].h + dt * a[cuts[j].pos] <= hi) break; wyn += (last - cuts[j].pos) * cuts[j].h + (suf[cuts[j].pos] - suf[last]) * dt - (last - cuts[j].pos) * hi; last = cuts[j].pos; j--; cuts.pop_back(); } ll minn = cuts[j].pos; ll maks = last; while (minn + 1 < maks){ // cout<< minn<<" "<<maks<<"\n"; ll sr = (minn + maks) / 2; if (cuts[j].h + dt * a[sr] <= hi) minn = sr; else maks = sr; } if (cuts[j].h + dt * a[minn] <= hi) minn++; //cout<<minn<<" "; wyn += (last - minn) * cuts[j].h + (suf[minn] - suf[last]) * dt - (last - minn) * hi; cout<<wyn<<"\n"; if(wyn != 0) cuts.push_back(cut(tajm, hi, minn)); } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | #include<iostream> #include<vector> #include<algorithm> #define ft first #define sd second #define pb push_back using namespace std; typedef long long ll; struct cut{ ll t, h, pos; cut(ll t, ll h, ll pos) : t(t), h(h), pos(pos) {} }; const ll N = 1000000; ll n, m; ll a[N],suf[N]; ll tajm, hi, res; vector<cut> cuts; int main(){ cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+n+1); for(int i=n;i>=0;i--) suf[i]=suf[i+1]+a[i]; cuts.push_back(cut(0,0,0)); for(int i=0;i<m;i++){ // cout<<i<<" "; cin>>tajm>>hi; ll j=cuts.size()-1; ll last = n + 1; ll wyn = 0; ll dt; while(1){ dt = tajm - cuts[j].t; if(cuts[j].h + dt * a[cuts[j].pos] <= hi) break; wyn += (last - cuts[j].pos) * cuts[j].h + (suf[cuts[j].pos] - suf[last]) * dt - (last - cuts[j].pos) * hi; last = cuts[j].pos; j--; cuts.pop_back(); } ll minn = cuts[j].pos; ll maks = last; while (minn + 1 < maks){ // cout<< minn<<" "<<maks<<"\n"; ll sr = (minn + maks) / 2; if (cuts[j].h + dt * a[sr] <= hi) minn = sr; else maks = sr; } if (cuts[j].h + dt * a[minn] <= hi) minn++; //cout<<minn<<" "; wyn += (last - minn) * cuts[j].h + (suf[minn] - suf[last]) * dt - (last - minn) * hi; cout<<wyn<<"\n"; if(wyn != 0) cuts.push_back(cut(tajm, hi, minn)); } } |