B - Products of Min-Max (思维+幂次函数递推)

https://atcoder.jp/contests/arc116/tasks/arc116_b

---

思路:

第一眼n^2,然后往贡献法想..gg。

正解是在幂次函数这里有个递推。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
const LL mod=998244353;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    LL ans=0;
    for(LL i=1;i<=n;i++) cin>>a[i],ans=(ans%mod+a[i]*a[i]%mod)%mod;
    sort(a+1,a+1+n);
    LL cnt=0;
    for(LL i=1;i<=n;i++){
        ans=(ans%mod+a[i]%mod*cnt%mod)%mod;
        cnt=(cnt*2%mod+a[i]%mod)%mod;
    }
    cout<<ans%mod<<"\n";
return 0;
}