Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18411 Accepted Submission(s): 9231
Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.
Now Pudge wants to do some Z??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcGVyYXRpb25zIG9uIHRoZSBob29rLjxicj4KPGJyPgpMZXQgdXMgbnVtYmVyIHRoZSBjb25zZWN1dGl2ZSBtZXRhbGxpYyBzdGlja3Mgb2YgdGhlIGhvb2sgZnJvbSAxIHRvIE4uIEZvciBlYWNoIG9wZXJhdGlvbiwgUHVkZ2UgY2FuIGNoYW5nZSB0aGUgY29uc2VjdXRpdmUgbWV0YWxsaWMgc3RpY2tzLCBudW1iZXJlZCBmcm9tIFggdG8gWSwgaW50byBjdXByZW91cyBzdGlja3MsIHNpbHZlciBzdGlja3Mgb3IgZ29sZGVuIHN0aWNrcy48YnI+ClRoZSB0b3RhbCB2YWx1ZSBvZiB0aGUgaG9vayBpcyBjYWxjdWxhdGVkIGFzIHRoZSBzdW0gb2YgdmFsdWVzIG9mIE4gbWV0YWxsaWMgc3RpY2tzLiBNb3JlIHByZWNpc2VseSwgdGhlIHZhbHVlIGZvciBlYWNoIGtpbmQgb2Ygc3RpY2sgaXMgY2FsY3VsYXRlZCBhcyBmb2xsb3dzOjxicj4KPGJyPgpGb3IgZWFjaCBjdXByZW91cyBzdGljaywgdGhlIHZhbHVlIGlzIDEuPGJyPgpGb3IgZWFjaCBzaWx2ZXIgc3RpY2ssIHRoZSB2YWx1ZSBpcyAyLjxicj4KRm9yIGVhY2ggZ29sZGVuIHN0aWNrLCB0aGUgdmFsdWUgaXMgMy48YnI+Cjxicj4KUHVkZ2Ugd2FudHMgdG8ga25vdyB0aGUgdG90YWwgdmFsdWUgb2YgdGhlIGhvb2sgYWZ0ZXIgcGVyZm9ybWluZyB0aGUgb3BlcmF0aW9ucy48YnI+CllvdSBtYXkgY29uc2lkZXIgdGhlIG9yaWdpbmFsIGhvb2sgaXMgbWFkZSB1cCBvZiBjdXByZW91cyBzdGlja3MuPGJyPgoKCiAKPGJyPgoKSW5wdXQKClRoZSBpbnB1dCBjb25zaXN0cyBvZiBzZXZlcmFsIHRlc3QgY2FzZXMuIFRoZSBmaXJzdCBsaW5lIG9mIHRoZSBpbnB1dCBpcyB0aGUgbnVtYmVyIG9mIHRoZSBjYXNlcy4gVGhlcmUgYXJlIG5vIG1vcmUgdGhhbiAxMCBjYXNlcy48YnI+CkZvciBlYWNoIGNhc2UsIHRoZSBmaXJzdCBsaW5lIGNvbnRhaW5zIGFuIGludGVnZXIgTiwgMTw9Tjw9MTAwLDAwMCwgd2hpY2ggaXMgdGhlIG51bWJlciBvZiB0aGUgc3RpY2tzIG9mIFB1ZGdloa9zIG1lYXQgaG9vayBhbmQgdGhlIHNlY29uZCBsaW5lIGNvbnRhaW5zIGFuIGludGVnZXIgUSwgMDw9UTw9MTAwLDAwMCwgd2hpY2ggaXMgdGhlIG51bWJlciBvZiB0aGUgb3BlcmF0aW9ucy48YnI+Ck5leHQgUSBsaW5lcywgZWFjaCBsaW5lIGNvbnRhaW5zIHRocmVlIGludGVnZXJzIFgsIFksIDE8PVg8PVk8PU4sIFosIDE8PVo8PTMsIHdoaWNoIGRlZmluZXMgYW4gb3BlcmF0aW9uOiBjaGFuZ2UgdGhlIHN0aWNrcyBudW1iZXJlZCBmcm9tIFggdG8gWSBpbnRvIHRoZSBtZXRhbCBraW5kIFosIHdoZXJlIFo9MSByZXByZXNlbnRzIHRoZSBjdXByZW91cyBraW5kLCBaPTIgcmVwcmVzZW50cyB0aGUgc2lsdmVyIGtpbmQgYW5kIFo9MyByZXByZXNlbnRzCiB0aGUgZ29sZGVuIGtpbmQuPGJyPgoKCiAKPGJyPgoKT3V0cHV0CgpGb3IgZWFjaCBjYXNlLCBwcmludCBhIG51bWJlciBpbiBhIGxpbmUgcmVwcmVzZW50aW5nIHRoZSB0b3RhbCB2YWx1ZSBvZiB0aGUgaG9vayBhZnRlciB0aGUgb3BlcmF0aW9ucy4gVXNlIHRoZSBmb3JtYXQgaW4gdGhlIGV4YW1wbGUuPGJyPgoKCiAKPGJyPgoKU2FtcGxlIElucHV0Cgo8cHJlIGNsYXNzPQ=="brush:java;">1 10 2 1 5 2 5 9 3
Sample Output
Case 1: The total value of the hook is 24.
题意很简单，求总区间的和。每次更新时不要更新到底层就行，更新完成时顺便求和就行。最后f[1].s即是ans.
#include#include #include #include #include using namespace std; #define ll __int64 #define N 200005 struct node { int l,r; int s,v,f; //区间和、该区间的单个点的值、f为不零则该区间有待更新值 }f[N*3]; void creat(int t,int l,int r) { f[t].l=l; f[t].r=r; f[t].v=1; f[t].f=0; if(l==r) { f[t].s=1; return ; } int tmp=t<<1,mid=(l+r)>>1; creat(tmp,l,mid); creat(tmp|1,mid+1,r); f[t].s=f[tmp].s+f[tmp|1].s; } void update(int t,int l,int r,int v) { int tmp=t<<1,mid=(f[t].l+f[t].r)>>1; if(f[t].l==l