给定长度为n的数组b,求对于任意1<=l<=r<=n, 求b[i] + b[j] + b[k] - (r - l) 的最大值(l<=i, j, k<=r)
题目思路:#includeusingnamespacestd;#defineintlonglong#definepbpush_back#definefifirst#definesesecond#definelsonp>n;for(inti=1;i>b[i];}for(inti=1;i=1;i--){suf[i]=max(suf[i+1],b[i]-i);}for(inti=2;i>T;while(