Submission #880526

#TimeUsernameProblemLanguageResultExecution timeMemory
880526tsumondaiAutići (COCI22_autici)C++14
0 / 50
8 ms3556 KiB
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e6 + 5;
 
const int oo = 1e9, mod = 1e9 + 7;
 
int n, m, k, d[N];
string s;
vector<int> arr;

void process() {
	cin >> n;
	foru(i,1,n) cin >> d[i];
	int minx=oo, idx=1;
	foru(i,1,n) {
		if (d[i]<minx) {
			minx=d[i];
			idx=i;
		}
	}

	int res=0;

	ford(i,idx-1,1) {
		res+=d[i]+minx;
	}

	foru(i, idx+1, n) {
		res+=d[i]+minx;
	}

	cout << res;

    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    process();
    cerr << "Time elapsed: " << __TIME << " s.\n";
    return 0;
}

/*
Xét các trường hợp đặc biệt
Kiểm tra lại input/output
Cố gắng trâu
Lật ngược bài toán
Keep calm and get VOI 
Flow:

*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...