用n个不同的字符(编号1 - n),组成一个字符串,有如下2点要求: 1、对于编号为i 的字符,如果2 * i > n,则该字符可以作为最后一个字符,但如果该字符不是作为最后一个字符的话,则该字符后面可以接任意字符; 2、对于编号为i的字符,如果2 * i <= n,则该字符不可以作为最后一个字符,且该字符后面所紧接着的下一个字符的编号一定要 >= 2 * i。 问有多少长度为M且符合条件的字符串。 例如:N = 2,M = 3。则abb, bab, bbb是符合条件的字符串,剩下的均为不符合条件的字符串。 输入:n,m (2<=n,m<=1000000000); 输出:满足条件的字符串的个数,由于数据很大,输出该数Mod 10^9 + 7的结果。 函数头部 int validstring(int n,int m) { }
#include <iostream>
using namespace std;
const int BIGGEST = 1000000007;
int validstring(int n, int m)
{
int **buf = new int*[2];
for (int i = 0; i < 2; i++)
{
buf[i] = new int[n+1];
}
int halfNum = n/2;
int curBuf = 0;
for (int i = 1; i <= halfNum; i++)
{
buf[0][i] = 0;
}
for (int i = halfNum+1; i <= n; i++)
{
buf[0][i] = 1;
}
int pos = m-2;
int oldBuf = 0;
long long int result = 0;
while (pos >= 0)
{
curBuf = curBuf == 0? 1 : 0;
oldBuf = curBuf == 0? 1 : 0;
for (int j = 1; j <= n; j++)
{
result = 0;
int begin = j <= halfNum? 2*j : 1;
for (int x = begin; x <= n; x++)
{
result += buf[oldBuf][x];
if (result >= BIGGEST)
{
result %= BIGGEST;
}
}
buf[curBuf][j] = result;
}
pos--;
}
result = 0;
for (int i = 1; i <= n; i++)
{
result += buf[curBuf][i];
if (result >= BIGGEST)
{
result %= BIGGEST;
}
}
for (int i = 0; i < 2; i++)
{
delete []buf[i];
}
delete []buf;
return result;
}
int main()
{
cout << validstring(1000, 100) << endl;
return 0;
}