更加感性的理解就是求一个dis[i]表示由n个 a[i] 求和 modT 为 i 的最小值
这样就可以先跑一遍最短路,算出dis,然后从0到T-1走一遍,算出在Bmin-Bmax有多少数就行了
代码
#include<bits/stdc++.h>
using namespace std;
#define PLI pair<long long ,int>
const int maxn=15;
typedef long long ll;
const int N=5e5+5;
const long long inf=1e18;
long long read()
{
long long x=0,f=1;
char cc=getchar();
while(cc!='-' &&(cc<'0' || cc>'9')) cc=getchar();
if(cc=='-') f=-1,cc=getchar();
while(cc<='9' && cc>='0') x=x*10+cc-'0',cc=getchar();
return x*f;
}
int n,cnt;
long long l,r,dis[N];
int a[maxn],vis[N],head[N];
struct edge
{
int to,nxt,val;
}e[N*12];
void add(int x,int y,int z)
{
e[++cnt].to=y;
e[cnt].nxt=head[x];
e[cnt].val=z;
head[x]=cnt;
}
int minn=0x3f3f3f3f;
void dijkstra()
{
priority_queue <PLI,vector<PLI>,greater<PLI> > q;
for(int i=0;i<=minn;i++) dis[i]=inf;
dis[0]=0;
q.push(make_pair(0,0));
while(!q.empty())
{
int u=q.top().second;
q.pop();
if(vis[u]) continue;
vis[u];
for(int i=head[u];i;i=e[i].nxt)
{
int to=e[i].to;
if(dis[to]>dis[u]+e[i].val)
{
dis[to]=dis[u]+e[i].val;
q.push(make_pair(dis[to],to));
}
}
}
}
ll calc(ll x, ll y, ll z)
{
if(x<y) return 0;
return (x-y)/z+1;
}
int main()
{
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
n=read(); l=read(); r=read();
for(int i=1;i<=n;i++) a[i]=read(),minn=min(minn,a[i]);
for(int i=1;i<=n;i++)
for(int j=0;j<minn;j++)
add(j,(a[i]+j)%minn,a[i]);
dijkstra();
long long ans=0;
for(int i=0;i<minn;i++)
ans+=calc(r,dis[i],minn)-calc(l-1,dis[i],minn);
printf("%lld",ans);
return 0;
}