贪心,每次用最大和次大合成,当最大和次大都是正数的时候就可以矩乘算斐波那契前n项和了
矩阵如下
1 1 1
1 0 1
0 0 1
第一列是i项,第二列是i-1项,第三列是和
注意模不是1e9+7!
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 1010
#define MAXM 1010
#define ll long long
#define INF 1000000000
#define MOD 10000007
#define eps 1e-8
ll n,m;
struct mt{
ll x[4][4];
mt(){
memset(x,0,sizeof(x));
}
friend mt operator *(mt x,mt y){
ll i,j,k;
mt z;
for(i=1;i<=3;i++){
for(j=1;j<=3;j++){
for(k=1;k<=3;k++){
(z.x[i][j]+=(ll)x.x[i][k]*y.x[k][j]%MOD)%=MOD;
}
}
}
return z;
}
void pt(){
ll i,j;
for(i=1;i<=3;i++){
for(j=1;j<=3;j++){
printf("%lld ",x[i][j]);
}
printf("\n");
}
}
};
mt a,b,c;
ll mx=-INF,mx2=-INF;
ll ans;
int main(){
//freopen("data.txt","r",stdin);
ll i;
ll x;
scanf("%lld%lld",&n,&m);
for(i=1;i<=n;i++){
scanf("%lld",&x);
ans+=x;
ans+=MOD;
ans%=MOD;
if(x>mx){
mx2=mx;
mx=x;
}else if(x>mx2){
mx2=x;
}
}
if(mx<0){
ans+=((ll)(mx+mx2)*m%MOD+MOD)%MOD;
ans%=MOD;
printf("%lld\n",ans);
return 0;
}
while(m&&mx2<0){
ans+=mx+mx2;
ans+=MOD;
ans%=MOD;
mx2=mx+mx2;
mx2+=MOD;
mx2%=MOD;
m--;
}
a.x[1][1]=1;
a.x[2][1]=1;
a.x[1][2]=1;
a.x[1][3]=1;
a.x[3][3]=1;
a.x[2][3]=1;
b.x[1][1]=b.x[2][2]=b.x[3][3]=1;
c.x[1][1]=mx;
c.x[1][2]=mx2;
c.x[1][3]=0;
while(m){
if(m&1){
b=b*a;
}
a=a*a;
m>>=1;
}
c=c*b;
(ans+=c.x[1][3]+MOD)%=MOD;
printf("%lld\n",ans);
return 0;
}
/*
10 654321
-45 -62 -78 -12 -95 -78 -13 -65 -98 78
*/