Submission #1303967

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303967		activedeltorre	Real Mountains (CCO23_day1problem2)	C++20	0 / 25	2 ms	572 KiB

Main

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>


using namespace std;
int v[1000005];
int b[1000005];
int calc(int val,int n)
{
    int minval=105,minprefix=105,minsuffix=105,gas10=0,p1=n+1,p2=-1;
    for(int i=1;i<=n;i++)
    {
        if(v[i]<val)
        {
            b[i]=0;
        }
        else
        {
            b[i]=1;
            minval=min(minval,v[i]);
        }
        if(b[i]==0 && b[i-1]==1 && i>=2)
        {
            p1=min(p1,i);
        }
        if(b[i]==1 && b[i-1]==0 && i>=2)
        {
            p2=max(p2,i-1);
        }
    }
    if(p2==-1)
    {
        return 0;
    }
    int cnt0=0;
    for(int i=p1;i<=p2;i++)
    {
        if(b[i]==0)
        {
            cnt0++;
        }
    }
    for(int i=1;i<=p1;i++)
    {
        if(b[i]==1)
        {
            minprefix=min(minprefix,v[i]);
        }
    }
    for(int i=p2;i<=n;i++)
    {
        if(b[i]==1)
        {
            minsuffix=min(minsuffix,v[i]);
        }
    }
    long long suma=0;
    if(cnt0>=1)
    {
        suma=suma+minprefix+minsuffix+val-1;
        cnt0--;
    }
    if(cnt0>=1)
    {
        suma=suma+minval+val+val-1;
        cnt0--;
    }
    return suma+cnt0*(2*val+val-1);
}
signed main()
{
    long long n,i,j,k,l,t,h,w,x,m,a,b;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
    }
    long long tot=0;
    for(int val=1;val<=100;val++)
    {
        tot=tot+calc(val,n);
    }
    cout<<tot;
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 3
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 4