제출 #1291972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291972		NValchanov	Fancy Fence (CEOI20_fancyfence)	C++20	0 / 100	1 ms	576 KiB

fancyfence

#include <iostream>
#include <vector>

using namespace std;

typedef long long llong;

const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 10;
const int INF = 1e9 + 10;

int n;
int w[MAXN];
int h[MAXN];
llong dp[MAXN];
llong prefw[MAXN];
int toleft[MAXN];

void read()
{
    cin >> n;

    for(int i = 1; i <= n; i++)
    {
        cin >> h[i];
    }

    for(int i = 1; i <= n; i++)
    {
        cin >> w[i];
    }
}

void precomp()
{
    for(int i = 1; i <= n; i++)
    {
        prefw[i] = prefw[i - 1] + w[i]; 
    }

    vector < int > st;
    h[0] = -INF;
    st.push_back(0);

    for(int i = 1; i <= n; i++)
    {
        while(h[st.back()] >= h[i])
            st.pop_back();

        toleft[i] = st.back();

        st.push_back(i);
    }
}

void solve()
{
    for(int i = 1; i <= n; i++)
    {
        llong len = prefw[i] - prefw[toleft[i]];

        
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27