#include #include #include #include #include #include #include int gcd(int a, int b) { if (a == 0) return b; return gcd(b%a, a); } int findGCD(int a[], int l,int r) { int result = a[l]; for (int i=l+1; i<=r; i++) result = gcd(a[i], result); return result; } int main() { int n,i,ans=0,f,max,s,j,g; scanf("%i", &n); int *a = malloc(sizeof(int) * n); for (i = 0;i < n; i++) { scanf("%i",&a[i]); } for(i=0;ia[j]?max:a[j]; s=s+a[j]; f=g*(s-max); ans=ans>f?ans:f; } //ans=ans>f?ans:f; } printf("%d",ans); return 0; }