#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int a[50009];
priority_queue<int,vector<int>,greater<int> > q;
int main()
{
int m;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
q.push(a[i]);
}
sort(a+1,a+m+1);
int minn=a[m];
for(int i=m-1;i>=1;i--)
minn=minn*a[i]+1;
int maxx;
while(q.empty()==0)
{
int a=q.top();
q.pop();
if(q.empty()==1)
{
maxx=a;
break;
}
int b=q.top();
q.pop();
q.push(a*b+1);
}
printf("%d",maxx-minn);
return 0;
}
1427:数列极差
最新推荐文章于 2021-06-16 17:47:38 发布