P4144 大河的序列

题面:https://www.luogu.org/problem/P4144

本题中显然选大的数对答案来说更优,而同时选小的数会让答案更劣,所以ans=max{a[I]}*2;
Code:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
long long n,b,mod,maxn;
long long max(long long p,long long q){
    return p>q?p:q;
}
long  long ksm(long  long x,long  long k){
    long long ans=1,base=x;
    while(k){
        if(k&1){
            ans=(ans*base)%mod;
        }
        base=(base*base)%mod;
        k/=2;
    }
    return ans;
}
int main(){
    long long x;
    scanf("%lld%lld%lld",&n,&b,&mod);
    for(int i=1;i<=n;i++){
        scanf("%lld",&x);
        maxn=max(x,maxn);
    }
    printf("%lld\n",ksm(maxn*2+233,b)%mod);
    return 0;
}

转载于:https://www.cnblogs.com/ukcxrtjr/p/11485382.html