斐波那契数列的和【矩阵乘法】

>Link

luogu U145243

---

>Description
求 $f_n=f_{n-1}+f_{n-2}$ 序列中前 $N$ 项的和，其中$f_1=f_2=1$

---

>解题思路

又一矩阵乘法例题，与斐波那契数列Ⅱ相似

方案一：
设$s_n$为序列中前$N$项的和，如何推导 $s_n=f_{n+2}-1$：
$f_{n+2}-1=f_n+f_{n+1}-1=f_n+f_{n-1}+f_n=f_n+f_{n-1}+...+f_1+f_2-1=f_n+f_{n-1}+...+f_1=s_n$
$\therefore s_n=f_{n+2}-1$

因此求第$n+2$项即可

方案二：
普通算法，定义矩阵$A$转移为
$\left[\begin{array}{ccc}{f}_{n-1}& f_n& s_{n-1}\end{array}\right]\to \left[\begin{array}{ccc}{f}_n& f_{n+1}(f_n+f_{n-1})& s_n(s_{n-1}+f_n)\end{array}\right]$

$\therefore$我们把$A$矩阵设为$\left[\begin{array}{ccc}1& 1& 1\end{array}\right]$
$B$矩阵设为$\left[\begin{array}{ccc}0& 1& 0\\ 1& 1& 1\\ 0& 0& 1\end{array}\right]$

---

>代码

方案一：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;

const LL p = 1e9 + 7;
struct matrix
{
	int x, y;
	LL a[10][10];
} A, B, ans;
LL n;

matrix operator *(matrix a, matrix b)
{
	matrix c;
	c.x = a.x, c.y = b.y;
	for (int i = 1; i <= c.x; i++)
	  for (int j = 1; j <= c.y; j++) c.a[i][j] = 0;
	for (int k = 1; k <= a.y; k++)
	  for (int i = 1; i <= a.x; i++)
	    for (int j = 1; j <= b.y; j++)
	      c.a[i][j] = (c.a[i][j] + a.a[i][k] * b.a[k][j] % p) % p;
	return c;
}
void power (LL k)
{
	if (k == 1) {B = A; return;}
	power (k >> 1);
	B = B * B;
	if (k & 1) B = B * A;
}

int main()
{
	scanf ("%lld", &n);
	n += 2;
	A.x = A.y = 2;
	A.a[1][1] = 0, A.a[1][2] = 1;
	A.a[2][1] = A.a[2][2] = 1;
	power (n - 1);
	ans.x = 1, ans.y = 2;
	ans.a[1][1] = ans.a[1][2] = 1;
	ans = ans * B;
	printf ("%lld", ans.a[1][1] - 1);
	return 0;
}

方案二：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;

const LL p = 1e9 + 7;
struct matrix
{
	int x, y;
	LL a[10][10];
} A, B, ans;
LL n;

matrix operator *(matrix a, matrix b)
{
	matrix c;
	c.x = a.x, c.y = b.y;
	for (int i = 1; i <= c.x; i++)
	  for (int j = 1; j <= c.y; j++) c.a[i][j] = 0;
	for (int k = 1; k <= a.y; k++)
	  for (int i = 1; i <= a.x; i++)
	    for (int j = 1; j <= b.y; j++)
	      c.a[i][j] = (c.a[i][j] + a.a[i][k] * b.a[k][j] % p) % p;
	return c;
}
void power (LL k)
{
	if (k == 1) {B = A; return;}
	power (k >> 1);
	B = B * B;
	if (k & 1) B = B * A;
}

int main()
{
	scanf ("%lld", &n);
	A.x = A.y = 3;
	A.a[1][1] = A.a[1][3] = A.a[3][1] = A.a[3][2] = 0;
	A.a[1][2] = A.a[2][1] = A.a[2][2] = A.a[2][3] = A.a[3][3] = 1;
	power (n - 1);
	ans.x = 1, ans.y = 3;
	ans.a[1][1] = ans.a[1][2] = ans.a[1][3] = 1;
	ans = ans * B;
	printf ("%lld", ans.a[1][3]);
	return 0;
}