loj514模拟只会猜题意

果然是道模拟。。。

一开始想线段树

看了一眼数据范围：“这tm不是前缀和吗”

然后水过

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#define ll unsigned long long
#define pi 3.14
#define eps 1e-9
#define inf 2147483233
#define m(a) memset(a,0,sizeof(a))
#define M(a) memset(a,127,sizeof(a))
#define REP(i,m,n) for(int i=1;i<=n;i++)
#define DWN(i,n,m) for(int i=n;i>=1;i++)
#define lowbit(x) x&(-x)
using namespace std;
int a[],n,m,ans[];
const int Size=<<;
char buffer[Size],*head,*tail;
inline char Getchar() {
    if(head==tail) {
        int l=fread(buffer,,Size,stdin);
        tail=(head=buffer)+l;
    }
    if(head==tail) return -;
    return *head++;
}
inline int read()
{
    int x=,f=;
    char ch=Getchar();
    while(!isdigit(ch)){if(ch=='-')f=-;ch=Getchar();}
    while(isdigit(ch)){x=*x+ch-'';ch=Getchar();}
    return x*f;
}
inline void write(int x)
{
    int num=;
    char buf[];
    while(x)buf[++num]=(x%)+'',x/=;
    while(num)putchar(buf[num--]);
    putchar('\n');
}
int main()
{
    n=read(),m=read();
    for(int i=;i<=n;i++)
    {
        a[i]=read();
        a[i]+=a[i-];
    }
    memset(ans,0xcf,sizeof(ans));
    int x;
    for(int i=;i<=n;i++)
    {
        for(int l=;l+i-<=n;l++)
        {
            int r=l+i-;
            ans[i]=max(ans[i],a[r]-a[l-]);
        }
    }
    for(int i=n-;i>=;i--) ans[i]=max(ans[i],ans[i+]);
    for(int i=;i<=m;i++)
    {
        x=read();
        printf("%d\n",ans[x]);
    }
}