信息学奥赛一本通T1549-最大数-题解（C++代码）
```cpp#include#include#includeusingnamespacestd;intmain(){charc;vectorv;mapm;intn,p,t,a=0;scanf("%d%d",&n,&p);while(n--){scanf("\n%c%d",
[信息学奥赛一本通T1549-最大数] 线段树--单点修改区间查询
```cpp#include#defineULLunsignedlonglong#defineLLlonglong#definePIIpairusingnamespacestd;constintN=2*1e5+10,M=2*1e3+10,inf=0x3f3f3f3f;structnode{intl,