[ACM] hdu 1698 Just a Hook (线段树,成段更新,懒惰标记) - 推酷
("%d%d%d",&a,&b,&add); update(a,b,add,1,n,1); } printf("Case %d: The total value of the hook is %d.\n",i,sum[1]); } return 0;...
ACM刷题打卡-160308简单题 - 简书
vector a; vector b; while(x-- > 0) { int temp_a; cin >> temp_a; a.push_back(temp_a); } while(y-- > 0) { int temp_b;...