【bzoj3231】[Sdoi2008]递归数列（矩乘）

题目：我是超链接
题解：
就这题目我居然刚了好久，男默女泪，多WA原因竟是？避免冗长+不清晰代码的方式—>写过程写函数
思路

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
LL b[20],c[20],m,n,k,p,he;
struct hh{LL sq[20][20];void cl(){memset(sq,0,sizeof(sq));}}a,mult,ans,ans1;
hh work(hh a,hh b)
{
    int i,j,kk;
    hh c;c.cl();
    for (i=1;i<=k+1;i++)
      for (j=1;j<=k+1;j++)
        for (kk=1;kk<=k+1;kk++)
          c.sq[i][j]=(c.sq[i][j]+a.sq[i][kk]*b.sq[kk][j]%p)%p;      
    return c;
}
LL doit(LL kk)
{
    int i,j;
    a.cl(); mult.cl(); ans.cl(); 
    mult.sq[1][1]=1;
    for (i=1;i<=k;i++) mult.sq[1][i+1]=c[i],mult.sq[2][i+1]=c[i];
    for (i=3;i<=k+1;i++) mult.sq[i][i-1]=1;
    hh lj=mult;
    a.sq[1][1]=he;int mm=k;
    for (i=2;i<=k+1;i++) a.sq[i][1]=b[mm--];

    for (;kk;kk>>=1,lj=work(lj,lj)) 
      if (kk&1) mult=work(lj,mult);

    kk=0;
    for (i=1;i<=k+1;i++)
      for (j=1;j<=1;j++)
        for (kk=1;kk<=k+1;kk++)
          ans.sq[i][j]=(ans.sq[i][j]+mult.sq[i][kk]*a.sq[kk][j]%p)%p;
    return ans.sq[1][1];
}
LL qurry(LL n)
{
    LL lq=0;int i;
    if (n<=k) for (i=1;i<=n;i++) lq=(lq+b[i])%p;
    else lq=doit(n-k-1);
    return lq;
}
int main()
{
    int i,j,kk;
    scanf("%d",&k);
    for (i=1;i<=k;i++) scanf("%lld",&b[i]);
    for (i=1;i<=k;i++) scanf("%lld",&c[i]);
    scanf("%lld%lld%lld",&m,&n,&p);
    for (i=1;i<=k;i++) he=(he+b[i])%p;
    printf("%lld\n",(qurry(n)-qurry(m-1)+p)%p);
}