发现至少有\(\frac{S}{5}\)个\(1\)，所以考虑维护\((k,T-k)\)的对数，然后二进制拆分+维护区间连续段背包dp即可。点击查看代码#include<bits/stdc++.h>#definefirfirst#definesecsecond#defineintlonglong#definelowbit(x)x&(-x)#definemkp(a,b)make_pair(