Guest User

2111

a guest
Jul 9th, 2025
49
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.94 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define vi vector<int>
  6. #define vl vector<long long>
  7. #define ll long long
  8. #define pb push_back
  9. #define mp make_pair
  10. #define ii pair<int,int>
  11.  
  12. int main(){
  13.  
  14. int casos, n, atual, anterior;
  15. int seq = 0;
  16. cin >> casos;
  17. while(casos--) {
  18. cin >> n;
  19. scanf("%d", &anterior);
  20. int min_n = anterior;
  21. int menor = anterior * (n-1);
  22. for(int i = 1; i < n; i++){
  23. scanf("%d", &atual);
  24. min_n = min(atual, min_n);
  25. if(atual == anterior) {
  26. seq++;
  27. menor = min(menor, anterior * (n - seq -1));
  28. } else {
  29. if(seq) {
  30. seq = 0;
  31. }
  32. }
  33.  
  34. anterior = atual;
  35.  
  36. }
  37. menor = min(menor, min_n * (n-1));
  38. cout << menor << endl;
  39. }
  40.  
  41.  
  42. return 0;
  43. }
Advertisement
Add Comment
Please, Sign In to add comment