牛客noip暑期七天营-普及组5 a

#include<algorithm>
#include<cstring>
using namespace std;
namespace io{
    #define re register
    #define ll long long
    #define inf 0x3f3f3f3f
    #define il inline 
    #define in1(a) read(a)
    #define in2(a,b) in1(a),in1(b)
    #define in3(a,b,c) in2(a,b),in1(c)
    #define in4(a,b,c,d) in2(a,b),in2(c,d)
    il void (ll &x){
        x=0;ll f=1;char c=getchar();
        while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
        x*=f;
    }
    il void read(int &x){
        x=0;int f=1;char c=getchar();
        while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
        x*=f;
    }
}using namespace io;
#define N 100005
int n;
ll a[N],s[N];
int main(){
	ll sum=0;
	read(n);
	for(re int i=1;i<=n;i++){
		readl(a[i]);
		sum+=a[i]*i;
	}
	for(re int i=n;i>=1;i--) s[i]=s[i+1]+a[i];
	ll ans=sum,l=0,r=sum;
	for(re int i=1;i<=n;i++){
		l+=a[i]*i;
		r-=s[i];
		ans=min(ans,l+r);
	}
	printf("%lld",ans);
	return 0;
}

#include<algorithm>
#include<cstring>
using namespace std;
namespace io{
    #define re register
    #define ll long long
    #define inf 0x3f3f3f3f
    #define il inline 
    #define in1(a) read(a)
    #define in2(a,b) in1(a),in1(b)
    #define in3(a,b,c) in2(a,b),in1(c)
    #define in4(a,b,c,d) in2(a,b),in2(c,d)
    il void (ll &x){
        x=0;ll f=1;char c=getchar();
        while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
        x*=f;
    }
    il void read(int &x){
        x=0;int f=1;char c=getchar();
        while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
        while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
        x*=f;
    }
}using namespace io;
#define N 100005
int n;
ll a[N],s[N],sum[N];
int main(){
	read(n);
	for(re int i=1;i<=n;i++){
		readl(a[i]);
		s[i]=s[i-1]+a[i];
		sum[i]=sum[i-1]+a[i]*i;
	}
	ll ans=sum[n];
	for(re int i=1;i<=n;i++){
		ans=min(ans,sum[n]-(s[n]-s[i])*i);
	}
	printf("%lld",ans);
	return 0;
}