2009年国家集训队武森论文 最远哈密顿距离。。。论文题。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 60005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head
struct node
{
int x[5];
}p[maxn];
multiset<int> s[1<<5];
multiset<int>::iterator it;
int n, m;
void init(void)
{
for(int i = 0; i < (1 << 5); i++) s[i].clear();
}
void work(void)
{
int cnt = 0, kk;
for(int i = 1; i <= n; i++) {
scanf("%d", &kk);
if(!kk) {
for(int j = 0; j < m; j++) scanf("%d", &p[i].x[j]);
for(int j = 0; j < (1 << m); j++) {
int t = 0;
for(int k = 0; k < m; k++) {
if((j >> k) & 1) t += p[i].x[k];
else t -= p[i].x[k];
}
s[j].insert(t);
}
cnt++;
}
else {
int x;
scanf("%d", &x);
for(int j = 0; j < (1 << m); j++) {
int t = 0;
for(int k = 0; k < m; k++) {
if((j >> k) & 1) t += p[x].x[k];
else t -= p[x].x[k];
}
it = s[j].find(t);
s[j].erase(it);
}
cnt--;
}
if(!cnt || cnt == 1) {
printf("0\n");
continue;
}
int ans = 0;
for(int j = 0; j < (1 << m); j++) {
ans = max(ans, *(--s[j].end()) - *(s[j].begin()));
}
printf("%d\n", ans);
}
}
int main(void)
{
while(scanf("%d%d", &n, &m)!=EOF) {
init();
work();
}
return 0;
}