求优化，悬小号一关

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include <bits/stdc++.h>
using namespace std;

const int MAXN = 70;

int n, s, now;
int a[MAXN], pre[MAXN], len[MAXN];

void dfs(int rel, int rea, int mina){
	if(rel == 0){ // 5
		dfs(now, rea - 1, a[n]);
		return;
	}
	if(rea == 0){
		printf("%d", now);
		exit(0);
	}
	mina = min(mina, rel);
	while(mina && len[mina] == 0)
		-- mina;
	while(mina){
		if(len[mina]){
			-- len[mina];
			dfs(rel - mina, rea, mina);
			++ len[mina];
			if(rel == rea || rel == mina) // 6
				return;
		}
		mina = pre[mina]; // 3
	}
}

signed main(){
	
	scanf("%d", &n);
	
	for(int i = 1; i <= n; ++ i)
		scanf("%d", &a[i]), s += a[i], ++ len[a[i]];
	
	sort(a + 1, a + n + 1); // 4
	
	for(int i = 1; i <= n; ++ i)
		if(a[i] != a[i - 1])
			pre[a[i]] = a[i - 1];
	
	for(now = a[n]; now <= s / 2; ++ now) // 2
		if(s % now == 0) // 1
			dfs(now, s / now, a[n]);
	
	printf("%d", s);
	
	return 0;
}