POJ（3468）
摘要：
A Simple Problem with Integershttp://poj.org/problem?id=3468#include struct node{ int l,r; __int64 sum; __int64 add;}tree[100000*3];void build(int left,int right,int root){ int mid=(left+right)/2; if(left==right) { tree[root].l=left; tree[root].r=right; tree[ro... 阅读全文
posted @ 2013-08-16 12:57 Chiryen 阅读(149) 评论(0) 推荐(0) 编辑