Valley Numer
Accepts: 548
Submissions: 1125
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
数位dp,dp[len][pre][up]表示当前到了第len位,上一位是pre,是否出现过递增的情况个数
#include<stdio.h>
#include<string.h>
#define mod 1000000007
#define LL long long
char pp[105];
LL str[105], temp[105], dp[105][12][105];
LL Sech(LL pos, LL pre, LL up, LL flag, LL k)
{
LL u, i, ans;
if(pos<0)
return 1;
if(flag==0 && k==0 && dp[pos][pre][up]!=-1)
return dp[pos][pre][up];
if(flag==1) u = str[pos];
else u = 9;
ans = 0;
for(i=0;i<=u;i++)
{
temp[pos] = i;
if(k==1)
{
ans += Sech(pos-1, i, 0, flag && i==u, k && (i==0));
continue;
}
if(i==pre)
ans += Sech(pos-1, i, up, flag && i==u, 0);
else if(i<pre)
{
if(up>0)
continue;
ans += Sech(pos-1, i, up, flag && i==u, 0);
}
else if(i>pre)
ans += Sech(pos-1, i, up+1, flag && i==u, 0);
}
ans %= mod;
if(flag==0 && k==0)
dp[pos][pre][up] = ans;
return ans;
}
int main(void)
{
LL T, n, i;
scanf("%I64d", &T);
memset(dp, -1, sizeof(dp));
while(T--)
{
scanf("%s", pp+1);
n = strlen(pp+1);
for(i=n;i>=1;i--)
str[i-1] = pp[n-i+1]-'0';
printf("%I64d\n", ((Sech(n-1, 0, 0, 1, 1)-1+mod)%mod));
}
}