點(diǎn)擊打開鏈接

題意:給出n個物品高度ai,ai<=1e9,ai非遞減,n,m<=1e5,m個方塊的寬度和高度,問m個方塊依次落下時達(dá)到的高度

每次都從左端點(diǎn)1開始疊放,第i個方塊肯定落在第i-1個方塊的上方 取高度邊界low=ans[i-1]+h[i-1]
高度遞增,(下標(biāo)>=i)高度>=a[i]的都能放的寬度為i的方塊
若l<a[w] ans[i]=a[w]?
若l>=a[w] ans[i]=l (因?yàn)楦叨萳以上的寬度都大于等于w)?

#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=2e5+20; ll n,m,a[N],w[N],h[N]; ll ans[N]; int main() {while(cin>>n){ll mx=0;for(int i=1;i<=n;i++){scanf("%I64d",&a[i]);mx=max(mx,a[i]);}cin>>m;for(int i=1;i<=m;i++)scanf("%I64d%I64d",&w[i],&h[i]);ans[0]=h[0]=0;for(int i=1;i<=m;i++){ll l=ans[i-1]+h[i-1];if(w[i]>n||l>=mx)//防止a[w[i]]溢出 w[i]<=1e9 ans[i]=l; else if(l<a[w[i]])ans[i]=a[w[i]];elseans[i]=l;cout<<ans[i]<<endl;}}return 0; } 線段樹做法(轉(zhuǎn)載)

?點(diǎn)擊打開鏈接

對于每一個箱子，只需要查詢[1,Wi]內(nèi)的最大值，箱子會被這個最大值支撐著，所以輸出這個最大值，放上這個箱子之后，這個區(qū)間內(nèi)的所有值都會變成上述的那個最大值加上箱子的高度Hi。用線段樹維護(hù)即可。

#include<cstdio> #include<cstring> #include<algorithm> #define LL long long #define maxn 100005 using namespace std; struct node {int l, r;LL c, maxh; }tree[maxn << 2]; int h[maxn]; void pushdown(int id) {if (tree[id].c){tree[id << 1].c = tree[id].c;tree[id << 1 | 1].c = tree[id].c;tree[id << 1].maxh = tree[id].maxh;tree[id << 1 | 1].maxh = tree[id].maxh;} } void build(int id, int l, int r) {tree[id].l = l;tree[id].r = r;if (tree[id].l == tree[id].r){tree[id].maxh = h[l];}else{int mid = (tree[id].l + tree[id].r) >> 1;build(id << 1, l, mid);build(id << 1 | 1, mid + 1, r);tree[id].maxh = max(tree[id << 1].maxh, tree[id << 1 | 1].maxh);} } void op(int id, int l, int r, LL c) {if (l <= tree[id].l&&tree[id].r <= r){tree[id].c = c;tree[id].maxh = c;}else{pushdown(id);int mid = (tree[id].l + tree[id].r) >> 1;if (l <= mid) op(id << 1, l, r, c);if (mid<r) op(id << 1 | 1, l, r, c);tree[id].maxh = max(tree[id << 1].maxh, tree[id << 1 | 1].maxh);} } LL que(int id, int l, int r) {if (l <= tree[id].l&&tree[id].r <= r){return tree[id].maxh;}else{pushdown(id);int mid = (tree[id].l + tree[id].r) >> 1;LL res = 0;if (l <= mid) res = max(res, que(id << 1, l, r));if (mid<r) res = max(res, que(id << 1 | 1, l, r));return res;} } int main() {int n;scanf("%d", &n);for (int i = 1; i <= n; i++) scanf("%d", &h[i]);int m;scanf("%d", &m);build(1, 1, n);while (m--){LL w, h;scanf("%I64d %I64d", &w, &h);LL tmp = que(1, 1, w);printf("%I64d\n", tmp);op(1, 1, w, tmp + h);}return 0; }

總結(jié)

以上是生活随笔為你收集整理的Codeforces 272C Dima and Staircase 思维 or 线段树的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。