Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define vi vector<int>
- #define vl vector<long long>
- #define ll long long
- #define pb push_back
- #define mp make_pair
- #define ii pair<int,int>
- int main(){
- int casos, n, atual, anterior;
- int seq = 0;
- cin >> casos;
- while(casos--) {
- cin >> n;
- scanf("%d", &anterior);
- int min_n = anterior;
- int menor = anterior * (n-1);
- for(int i = 1; i < n; i++){
- scanf("%d", &atual);
- min_n = min(atual, min_n);
- if(atual == anterior) {
- seq++;
- menor = min(menor, anterior * (n - seq -1));
- } else {
- if(seq) {
- seq = 0;
- }
- }
- anterior = atual;
- }
- menor = min(menor, min_n * (n-1));
- cout << menor << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment