关路灯

f[i][j][1/0]表示当前所耗电量
[1/0]表示扎左边还是在右边

因为只有两个转移
1从上个状态持续
2从上个状态调转.

#include<bits/stdc++.h>
#define ll long long
#define re return
#define inc(i,l,r) for(int i=l;i<=r;++i)

const int mod=1000000007;
char buf[1<<21],*p1,*p2;
inline int gc(){re p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}

template<typename T>inline void rd(T&x)
{
	char c;bool f=0;
	while((c=gc())<'0'||c>'9')if(c=='-')f=1;
	x=c^48;
	while((c=gc())>='0'and c<='9')x=x*10+(c^48);
	if(f)x=-x;
}

using namespace std;
int n,c,k,pos[55],sum[55],watt[55],f[55][55][2];


int main()
{

freopen("in.txt","r",stdin);
	rd(n),rd(c);
	inc(i,1,n)
	{
		rd(pos[i]);
		rd(watt[i]);sum[i]=watt[i]+sum[i-1];
	}
	memset(f,0x3f3f3f3f,sizeof(f));
	f[c][c][0]=f[c][c][1]=0;
	
	inc(k,1,n-1)
	{
		inc(i,max(1,c-k),min(c,n-k))
		{
			int j=i+k;
			f[i][j][0]=min(f[i+1][j][0]+(pos[i+1]-pos[i])*(sum[n]-sum[j]+sum[i]),f[i+1][j][1]+(pos[j]-pos[i])*(sum[n]-sum[j]+sum[i]));
			f[i][j][1]=min(f[i][j-1][0]+(pos[j]-pos[i])*(sum[n]-sum[j-1]+sum[i-1]),
			f[i][j-1][1]+(pos[j]-pos[j-1])*(sum[n]-sum[j-1]+sum[i-1]));
		}
	}
	
	printf("%d",min(f[1][n][1],f[1][n][0]));
	
	
	re 0;
}