Codeforces Educational Codeforces Round 56 (Rated for Div. 2) 1093G. Multidimensional Queries
有一kkk维点序列。求[l,r][l,r][l,r]之间Manhattan\text{Manhattan}Manhattan距离最大的点。要求点修改区间查询。解:每维的坐标分解如下：∣aj−bj∣=aj−bjorbj−aj,j=1,2,...,k|a_{j}-b_j|=a_{j}-b_{j}\or\b_{j}-a_{j},j=1,2,...,k∣aj−bj∣=aj−bjorbj−aj,j=1,2,