洛谷P4999 烦人的数学作业 数位dp

求$1\le l\le r\le 1e18$，区间内所有的数的数位之和。直接数位dp。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=LONG_LONG_MAX;
const int mod=1e9+7;
int a[20];
ll dp[20][20*9][2];
ll dfs(int pos,int sum,bool lim) {
	if(pos==0) return sum;
	if(dp[pos][sum][lim]!=-1)
		return dp[pos][sum][lim];
	ll ans=0;
	int up=lim?a[pos]:9;
	for(int i=0;i<=up;i++) {
		ans+=dfs(pos-1,sum+i,lim&&i==a[pos]);
		ans%=mod;
	}
	return dp[pos][sum][lim]=ans; 
}
ll solve(ll x) {
	int len=0;
	memset(dp,-1,sizeof(dp));
	while(x) {
		a[++len]=x%10;
		x/=10;		
	} 
	return dfs(len,0,1);
}
int main() {
	int T;
	scanf("%d",&T);
	while(T--) {
	 	ll l,r;
	 	scanf("%lld%lld",&l,&r);
	 	printf("%lld\n",((solve(r)-solve(l-1))%mod+mod)%mod);
	}
	return 0;
}