Codeforces-888E：Maximum Subsequence（思维）

最新推荐文章于 2020-12-05 23:21:11 发布

Mitsuha_

最新推荐文章于 2020-12-05 23:21:11 发布

阅读量576

点赞数 1

分类专栏：思维文章标签： ACM

本文链接：https://blog.csdn.net/Mitsuha_/article/details/78520651

版权

思维专栏收录该内容

57 篇文章 0 订阅

订阅专栏

You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1, b2, ..., bk (1 ≤ b1 < b2 < ... < bk ≤ n) in such a way that the value of $\text{[math]}$ is maximized. Chosen sequence can be empty.

Print the maximum possible value of $\text{[math]}$ .

Input

The first line contains two integers n and m (1 ≤ n ≤ 35, 1 ≤ m ≤ 109).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

Print the maximum possible value of $\text{[math]}$ .

   Examples 
 
     input 
   
4 4
5 2 4 1

     output 
   
3

     input 
   
3 20
199 41 299

     output 
   
19

Note

In the first example you can choose a sequence b = {1, 2}, so the sum $\text{[math]}$ is equal to 7 (and that's 3 after taking it modulo 4).

In the second example you can choose a sequence b = {3}.

思路：如果n<=20，可以考虑状态压缩,但n>=35。那么可以考虑把n个数分为2个部分来状态压缩，然后用vector<int>c储存第一部分各个状态模m后的值，然后枚举第二部分各个状态模m后的值y，那我们可以在c中二分查找m-y-1，如果找不到，可以考虑比m-y-1小的最大的数和比m-y-1大的最大的数，这样就能保证答案尽可能的靠近m-1。

#include<bits/stdc++.h>
using namespace std;
__int64 a[40],b[40],n,m;
vector<__int64>c;
__int64 aget(__int64 x)
{
    __int64 ans=0;
    for(__int64 i=0;i<n/2;i++,x/=2)if(x%2)ans+=a[i];
    return ans%m;
}
__int64 bget(__int64 x)
{
    __int64 ans=0;
    for(__int64 i=0;i<n-n/2;i++,x/=2)if(x%2)ans+=b[i];
    return ans%m;
}
int main()
{
    __int64 ans=0;
    scanf("%I64d%I64d",&n,&m);
    for(__int64 i=0;i<n/2;i++)scanf("%I64d",&a[i]),ans=max(ans,a[i]%m);
    for(__int64 i=0;i<n-n/2;i++)scanf("%I64d",&b[i]),ans=max(ans,b[i]%m);
    for(__int64 i=0;i<(1<<(n/2));i++)c.push_back(aget(i));
    sort(c.begin(),c.end());
    for(__int64 i=0;i<(1<<(n-n/2));i++)
    {
        __int64 y=bget(i);
        ans=max(ans,y);
        __int64 x=lower_bound(c.begin(),c.end(),m-y-1)-c.begin();
        if(c.size()>0)
        {
            if(x>=0&&x<c.size())ans=max(ans,(y+c[x])%m);
            if(x>0)ans=max(ans,(y+c[x-1])%m);
            ans=max(ans,(y+c[c.size()-1])%m);
        }
    }
    cout<<ans<<endl;
    return 0;
}