[CF1073E] Segment Sum

似乎就是一道数位$\mathtt{d}\mathtt{p}$的板，只是维数有点多，用状压来开？

Code

LL k, a[MAXN], Jw[MAXN];
struct node
{
   
	LL tot, Sum;
	node(){
   }
	node(LL TOT,LL SUM)
	{
   
		tot = TOT;
		Sum = SUM;
	}
	void Clear() {
    tot = Sum = 0; }
	bool Check() {
    return ~ tot && ~ Sum; }
} dp[2]