Codeforces 981 D.Bookshelves(数位DP)

[Codeforces 981 D.Bookshelves](http://codeforces.com/problemset/problem/981/D)
题目大意：
给n个数，将这n个数分为k段，（n,k
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
typedef long long ll;
typedef pair P;
typedef map M;
typedef queue Q;
typedef set S;
typedef vector V;
const int maxn=100;
bool dp[maxn][maxn];
ll pre[maxn];
bool is_exist(ll x,int n,int m)
{
memset(dp,0,sizeof(dp));
for (int i=1;i>n>>k;
for (i=1;i>a;
pre[i]=pre[i-1]+a;
}
ll ans=0;
for (i=60;i>=0;--i) //从高位枚举
{
if (is_exist(ans|(1ll