COGS 1580 WC2005 友好的生物

陈启峰神犇太神辣%%%%%%%%%%%%%%

题解我都看不懂

照着乱做的。。。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=100000+5;
const int inf=1e9;
int A[N][5],F[N][32],best[N][32],bin[10],rk[N],k,n,c[5];
bool cmp(int i,int j){
	return A[i][k]<A[j][k];
}
int flag(int bn,int i){
	if(bn&bin[i])return 1;
	return -1;
}
int main(){
	//freopen("a.in","r",stdin);
	bin[0]=1;
	for(int i=1;i<=5;i++)bin[i]=bin[i-1]<<1;
	scanf("%d %d",&n,&k);
	k--;
	for(int i=0;i<=k;i++)scanf("%d",&c[i]);
	for(int i=1;i<=n;i++)
	for(int j=0;j<=k;j++)
	scanf("%d",&A[i][j]),A[i][j]*=c[j];
	for(int i=1;i<=n;i++)rk[i]=i;
	sort(rk+1,rk+1+n,cmp);
	for(int bn=0;bn<bin[k+1];bn++){
		best[0][bn]=-inf;
		for(int i=1;i<=n;i++){
			for(int j=0;j<k;j++)
			F[i][bn]+=flag(bn,j)*A[rk[i]][j];
			F[i][bn]-=flag(bn,k)*A[rk[i]][k];
			best[i][bn]=max(best[i-1][bn],F[i][bn]);
		}
	}
	int ans=-inf;
	for(int bn=0;bn<bin[k+1];bn++)
	if(bn&bin[k])
	for(int i=2;i<=n;i++)
	ans=max(ans,best[i-1][bin[k+1]-1-bn]+F[i][bn]);
	printf("%d\n",ans);
	return 0;
}