2019ICPC南昌 G Eating Plan

\quad 给出$n$个数和$m$个查询，询问一段连续区间的每个数的阶乘和，找到最短的区间使得这段时间和大于$k$,输出这个区间的大小。

\quad 因为模数是合数，我们对阶乘打表会发现2802后的继承都是$0$,所以就可以暴力做了，$RMQ$处理区间最值，然后离线处理询问。

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
    int ret = 0, sgn = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9')
    {
        if(ch == '-')
            sgn = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        ret = ret*10 + ch - '0';
        ch = getchar();
    }
    return ret*sgn;
}
inline void Out(int a)    //Êä³öÍâ¹Ò
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}

ll gcd(ll a,ll b)
{
    return b==0?a : gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
    return a*b/gcd(a,b);
}
///快速幂m^k%mod
ll qpow(int m, int k, int mod)
{
    ll res=1, t=m;
    while (k)
    {
        if(k&1)
            res = res * t % mod;
        t = t * t % mod;
        k >>= 1;
    }
    return res;
}

// 快速幂求逆元
int Fermat(int a,int p)//费马求a关于b的逆元
{
    return qpow(a,p-2,p);
}


///扩展欧几里得
int exgcd(int a,int b,int &x,int &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    int g=exgcd(b,a%b,x,y);
    int t=x;
    x=y;
    y=t-a/b*y;
    return g;
}

///使用ecgcd求a的逆元x
int mod_reverse(int a,int p)
{
    int d,x,y;
    d=exgcd(a,p,x,y);
    if(d==1)
        return (x%p+p)%p;
    else
        return -1;
}

///中国剩余定理模板
ll china(int a[],int b[],int n)//a[]为除数，b[]为余数
{
    int M=1,y,x=0;
    for(int i=0; i<n; ++i) //算出它们累乘的结果
        M*=a[i];
    for(int i=0; i<n; ++i)
    {
        int w=M/a[i];
        int tx=0;
        int t=exgcd(w,a[i],tx,y);//计算逆元
        x=(x+w*(b[i]/t)*x)%M;
    }
    return (x+M)%M;
}

const int MAX_N=1e5+5;
const ll mod=998857459;
ll jc[MAX_N];
ll a[MAX_N];
int n,m;
struct node
{
    ll val;
    int id;
} rec[3000];
ll sum[3000],res[MAX_N];
int cnt=0;
int main()
{
    jc[0]=1;
    mem(a,0);
    mem(res,0);
    rep(i,1,2810)
    jc[i]=(jc[i-1]*(1ll*i))%mod;
    sd(n);
    sd(m);
    rep(i,1,n)
    {
        int x;
        sd(x);
        a[i]=jc[x];
    }
    sum[0]=0;
    rep(i,1,n)
    {
        if(a[i])
        {
            rec[++cnt].val=a[i];
            rec[cnt].id=i;
            sum[cnt]=sum[cnt-1]+rec[cnt].val;
        }
    }
    rep(i,1,cnt)
    {
        rep(j,i,cnt)
        {
            res[rec[j].id-rec[i].id+1]=max(res[rec[j].id-rec[i].id+1],(sum[j]-sum[i-1])%mod);
        }
    }
    while(m--)
    {
        ll x;
        scanf("%lld",&x);
        int ans=inf;
        rep(i,1,n)
        if(res[i]>=x)
        {
            ans=i;
            break;
        }
        if(ans==inf)
            puts("-1");
        else
            printf("%d\n",ans);
    }
    return 0;
}