Submission #19683367

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <sstream>
using namespace std;
int f(vector<int> &a){
    if (a.size()==0) return 0;
    if (a.size()==1) return a[0];
    int m=*min_element(a.begin(),a.end());
    auto mI=min_element(a.begin(),a.end());
    int score=a.size()*m;
    vector< int > b={a.begin(),mI};
    vector< int > c={mI+1,a.end()};
    score=max(score,f(b));
    return(max(score,f(c)));







}

int main() {
    int n;
    cin>>n;
    vector< int > a(n);
    int input;
    for(int i=0; i<n; i++){
        cin>>input;
        a[i]=input;
    }
    cout<<f(a);
/*    vector< int > b(a);
    sort(b.begin(),b.end(),greater<int>());
    for (int i=n-1;i>0;i--){
        if (b[i]==b[i-1]) b.erase(i);
    }

*/

    return 0;
}

Submission Info

Judge Result