链接:http://oj.51xiaocheng.com/contest/202/problem/C
BFS + 优先队列
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1010+10;
int n,k;
int a[20],m[10],suff[20];
int ans;
struct Node
{
int m[10],sum,mx,lb,p;
Node()
{
memset(m,0,sizeof(m));
sum=mx=lb=p=0;
}
bool operator<(const Node & b) const
{
return lb>b.lb;
}
};
void bfs()
{
Node node;
priority_queue<Node> pq;
pq.push(node);
while(!pq.empty())
{
auto t=pq.top();
pq.pop();
if(t.p==n)
{
ans=min(ans,t.mx);
return;
}
for(int i=1;i<=k;++i)
{
Node x=t;
x.p++;
if(x.m[i]+a[x.p]>=ans) continue;
x.m[i]+=a[x.p];
x.mx=max(x.mx,x.m[i]);
x.sum+=a[x.p];
int r=x.mx*k-x.sum;
x.lb=r<suff[x.p+1]?(suff[1]+k-1)/k:x.mx;
pq.push(x);
}
}
}
int main()
{
while(scanf("%d%d",&n,&k)&&(n||k))
{
for(int i=1;i<=n;++i) cin>>a[i];
suff[n+1]=0;
for(int i=n;i>=1;--i)
suff[i]=suff[i+1]+a[i];
ans=2e9;
bfs();
cout<<ans<<"\n";
}
return 0;
}
DFS
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1010+10;
int n,k;
int a[20],m[10];
int ans;
void dfs(int p)
{
if(p==n+1)
{
int res=0;
for(int i=1;i<=k;++i)
res=max(res,m[i]);
ans=min(ans,res);
return;
}
for(int i=1;i<=k;++i)
{
if(m[i]+a[p]>=ans) continue;
m[i]+=a[p];
dfs(p+1);
m[i]-=a[p];
}
}
int main()
{
while(scanf("%d%d",&n,&k)&&(n||k))
{
for(int i=1;i<=n;++i) cin>>a[i];
ans=2e9;
dfs(1);
cout<<ans<<"\n";
}
return 0;
}