Cod sursa(job #2972351)

Utilizator TraianQTraianQ TraianQ Data 29 ianuarie 2023 12:41:16
Problema Subsir crescator maximal Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int nmax = 2e5;
const int lgmax = 20;
int lg[200005],rmq[20][200005];
long long mars[200005],V[200005];
int main()
{
    ifstream cin("comisia.in");
    ofstream cout("comisia.out");
    int n;
    cin>>n;
    for(int i=2;i<=n;i++)
        lg[i]=1+lg[i/2];
    for(int i=1;i<=n;i++)
    {
        cin>>rmq[0][i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>V[i];
        mars[i]=mars[i-1]+V[i];
    }
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j<=n-(1<<i);j++)
            rmq[i][j]=max(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    long long val=1000000000000000000;
    for(int i=1;i<=n;i++)
    {
        int dr=i;
        while(dr<=n)
        {
            int dif=dr-i+1,l=lg[dif];
            dif-=(1<<l);
            int Q=max(rmq[l][i],rmq[l][i+dif]);
            if(Q==1)
                break;
            if(Q>dr-i+1)
                dr=i+Q-1;
            else
                break;
        }
        if(dr<=n)
        {
            val=min(val,mars[dr]-mars[i-1]);
        }
    }
    cout<<val;
    return 0;
}