C. Minimum Grid Path (thinking + enumeration + greedy)

https://codeforces.com/contest/1499/problem/C

---

Ideas:

Separate horizontally and vertically. And it is symmetrical. So, no matter what your sequence is, odd numbers are definitely a string, and even numbers are a string. For
example, 1 2 3 4 5, no matter how you turn, 1 3 5 is a set, 24 It is a collection.

So On enumeration, maintain a minimum and cumulative prefixes, the smallest will go as much as possible, and the rest will go one step ahead. On enumerates the minimum value

#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=1e5+100;
typedef long long LL;
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 t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL ans1=1e18;
    ///先上再右
    ans1=n*a[1]+n*a[2];
  ///  debug(ans1);
    LL jmin=a[1];LL omin=a[2];
    LL sum1=a[1];LL sum2=a[2];
    LL num1=1;LL num2=1;
    for(LL i=3;i<=n;i++){
        if(i&1){
            jmin=min(jmin,a[i]);

            sum1+=a[i];
            num1++;

            ans1=min(ans1,sum1-jmin+ (n-(num1-1) )*jmin+sum2-omin+(n-(num2-1) )*omin );



        ///    cout<<"i="<<i<<" "<<"ans1="<<ans1<<"\n";
        }
        else if(i%2==0){
            omin=min(omin,a[i]);

            sum2+=a[i];
            num2++;

            ans1=min(ans1,sum2-omin+(n-(num2-1))*omin+sum1-jmin+(n-(num1-1))*jmin  );

        ///    cout<<"i="<<i<<" "<<"ans1="<<ans1<<"\n";
        }

    }
    cout<<ans1<<"\n";
    ///先右再上
    LL ans2=1e18;

  }
return 0;
}