SW练习_1962 斐波那契数列_DP

F[2n+1] = F[n] * ( F[n-1]+F(n+1))

F[2n] =F[n]²+F[n-1]²

package info.frady.luogu;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class P1962 {
    static int Mod=1000000007;
    static Map<Long,Long> map=new HashMap<Long,Long>();
    public static void main(String[] args) throws Exception{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        long N=Long.parseLong(st.nextToken());
        System.out.println(F(N-1));
        reader.close();
    }

    public static Long F(Long x){
        if(x==1||x==0)return 1l;//边界
        if(map.get(x)!=null)return map.get(x);
        Long res=0l,t=x/2;
        if(x%2==1) {//x是奇数
            res=F(t)%Mod* ( F(t-1)+ F(t+1) )%Mod;// F[2n+1] = F[n] * ( F[n-1]+F(n+1))
        }else {//x是偶数
            res=  F(t)%Mod*F(t)%Mod + F(t-1)%Mod*F(t-1)%Mod;//F[2n] =F[n]²+F[n-1]²
        }
        res=res%Mod;
        map.put(x,res);
        return map.get(x);
    }
}