就是对每个城堡进行一次背包,然后.......,第一次写最后两个点wa了,百思不得其解,然后放弃了去一个最小值的优化,A了,郁闷
code
/*
ID: yueqiq
PROG: clocks
LANG: C++
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("input.txt","r",stdin)
#define writef freopen("output.txt","w",stdout)
const int maxn = 10001;
const int INF = 1111;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
using namespace std;
struct node
{
bool bo[10001];
}a[101];
int N;
int main()
{
SD(N);
int x;
FOR(i,1,N){
memset(a[i].bo,false,sizeof(a[i].bo));
a[i].bo[0]=true;
SD(x);
while (x>0){
FOD(j,10000,x)
a[i].bo[j]=(a[i].bo[j]|a[i].bo[j-x]);
SD(x);
}
}
int k=10000;
bool bk;
while(true){
bk=true;
FOR(i,1,N)
if (!a[i].bo[k]){
bk=false;
break;
}
if(bk) break;
k--;
}
printf("%d\n",k);
return 0;
}