http://acm.hdu.edu.cn/showproblem.php?pid=4350
优化的矩阵快速幂
#include <iostream>
#include <cstdio>
#include <memory.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <climits>
#include <vector>
#include <set>
#include <utility>
using namespace std;
#define MAXN 52
class Matrix
{
public:
int m[MAXN][MAXN];//二维数组存放矩阵
Matrix(){}//对数组的初始化
void init(int num[MAXN][MAXN])
{
for(int i = 0 ; i < MAXN ; i++)
{
for(int j = 0 ; j < MAXN ; j++)
{
m[i][j] = num[i][j];
}
}
}
//重载矩阵的乘法运算
friend Matrix operator*(Matrix &m1 ,Matrix &m2)
{
int i, j, k,w;
Matrix temp;
for (i = 0; i < MAXN; i++)
{
j = 0;
for(k = 0;k < MAXN;k++)
{
if(m1.m[i][k] == 1)
{
j = k;
break;
}
}
w = 0;
for(k = 0;k < MAXN;k++)
{
if(m2.m[j][k] == 1)
{
w = k;
break;
}
}
for(k = 0;k <MAXN;k++)
{
temp.m[i][k] = 0;
}
temp.m[i][w] = 1;
/*for (j = 0; j < MAXN; j++) {
temp.m[i][j] = 0;
for(k = 0 ; k < MAXN ; k++)
temp.m[i][j] += (m1.m[i][k] * m2.m[k][j]);//%mod
//temp.m[i][j] %= mod;
//注意每一步都进行取模
}*/
}
return temp;
}
//矩阵的快速幂
friend Matrix quickpow(Matrix &M , int n)
{
Matrix tempans;//初始化为单位矩阵
//初始化
for(int i = 0 ; i < MAXN ; i++)
{
for(int j = 0 ; j < MAXN ; j++)
{
if(i == j)
tempans.m[i][j] = 1;
else
tempans.m[i][j] = 0;
}
}
//快速幂(类似整数)
while(n)
{
if(n & 1) tempans = tempans * M;//已经重载了*
n = n >> 1;
M = M * M;
}
return tempans;
}
};
int main()
{
Matrix A,ans;
int T,n,l,r;
int num[MAXN][MAXN],poke[52];
scanf("%d",&T);
for (int cas=1;cas<=T;cas++)
{
for (int i=0;i<52;i++) scanf("%d",&poke[i]);
scanf("%d%d%d",&n,&l,&r);
memset(num,0,sizeof(num));
for (int i=l-1;i<r;i++)
num[i][i-l+1]=1;
for (int i=0;i<l-1;i++)
num[i][r-l+1+i]=1;
for (int i=r;i<52;i++)
num[i][i]=1;
/*for (int i=0;i<52;i++)
num[(r-l+i)%52][i]=1;*/
A.init(num);//初始化A矩阵
ans=quickpow(A,n);//求出矩阵的快速幂
int res[MAXN];
/*for (int i=0;i<52;i++)
{
for (int j=0;j<52;j++)
printf("%d ",ans.m[i][j]);
printf("\n");
}*/
memset(res,0,sizeof(res));
for (int i=0;i<52;i++)
for (int j=0;j<52;j++)
res[i]+=poke[j]*ans.m[j][i];
printf("Case #%d:",cas);
for (int i=0;i<52;i++)
printf(" %d",res[i]);
printf("\n");
}
return 0;
}
另一种方法是,找到移动的循环节,用暴力找到循环节,再用n模上循环节
#include <iostream>
#include <cstdio>
using namespace std;
int n,l,r;
struct Card
{
int c[53];
}card[500000],start;
void turn(Card &a,Card & b)
{
for(int i = r+1;i < 53;i++)
a.c[i] = b.c[i];
for(int i = 1;i <= r-l+1;i++)
a.c[i] = b.c[i+l-1];
for(int i = 1;i < l;i++)
a.c[r-l+ 1+ i] = b.c[i];
}
bool cmp(const Card & a)
{
bool bo = true;
for(int i = 1;i <= r;i++)
{
if(a.c[i] != start.c[i])
{
bo = false;
break;
}
}
return bo;
}
void output(const Card & a)
{
for(int i = 1;i < 53;i++)
printf(" %d",a.c[i]);
printf("\n");
}
int main()
{
int t,cas=1;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{
for(int i = 1;i < 53;i++)
{
scanf("%d",&card[0].c[i]);
start.c[i] = card[0].c[i];
}
scanf("%d%d%d",&n,&l,&r);
turn(card[1],start);
int j = 1;
while(!cmp(card[j]))
{
turn(card[j+1],card[j]);
j++;
}
int m = n % j;
printf("Case #%d:",cas++);
output(card[m]);
}
}
}