BZOJ 3827: [Poi2014]Around the world

/**************************************************************
    Problem: 3827
    User: BeiYu
    Language: C++
    Result: Accepted
    Time:70156 ms
    Memory:20820 kb
****************************************************************/
 
#include<cstdio>
#include<cstring>
#include<iostream>
 
using namespace std;
 
const int N = 1000005;
const int INF = 0x3fffffff;
 
int n,m,s,lim,ans;
int a[N],nxt[N<<1],d[N<<1];
 
inline int in(int x=0,char ch=getchar()){ while(ch>‘9‘||ch<‘0‘) ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘) x=(x<<3)+(x<<1)+ch-‘0‘,ch=getchar();return x; }
 
int DFS(int x){
    int ff=x;
    for(;ff<x+n;ff=nxt[ff]);
    for(int u=x,v=nxt[x];v!=ff;u=v,v=nxt[v]) nxt[u]=ff;
    return d[x]-d[ff];
}
int main(){
//  freopen("in.in","r",stdin);
    n=in(),s=in(),m=n<<1|1;
    for(int i=1;i<=n;i++) a[i]=in(),lim=max(lim,a[i]);
    for(int i=1,x;i<=s;i++){
        x=in();ans=INF;
        if(x<lim){ puts("NIE");continue; }
        for(int u=1,v=1,t=0;u<=m;u++){
            while(v<m&&t+a[v>n?v-n:v]<=x)
            t+=a[v>n?v-n:v],v++;
            nxt[u]=v,t-=a[u>n?u-n:u];
        }
        for(int i=m;i;i--) d[i]=d[nxt[i]]+1;
//      for(int i=1;i<=m;i++) cout<<nxt[i]<<" ";cout<<endl;
//      for(int i=1;i<=m;i++) cout<<d[i]<<" ";cout<<endl;
         
        for(int i=1;i<=n;i++) ans=min(ans,DFS(i));
        cout<<ans<<endl;
    }return 0;
}