제출 #596431

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
596431	2022-07-14 18:18:08	CaroLinda	Peru (RMI20_peru)	C++14	100 / 100	538 ms	34808 KiB

peru

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "peru.h"
#include <bits/stdc++.h>
#define ll long long
const int MAXN = 2500005;
const ll PRIME = 23;
const ll MOD = 1e9+7;
using namespace std;
ll dp[MAXN];
multiset<ll> ans;
deque<int> dq;
int solve(int n, int k, int* v){
    for(int i = 0; i < n; i++){
        while(!dq.empty() && dq.front() < i-k){
            int id = dq.front();
            
            dq.pop_front();
            
            if(!dq.empty())
                 ans.erase(ans.find(dp[id]+v[dq.front()]));
        }
        while(!dq.empty() && v[dq.back()] <= v[i]){
            ll tot = v[dq.back()];
            dq.pop_back();
            if(!dq.empty()){
                ans.erase(ans.find(dp[dq.back()]+tot));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 31 / 31
• Subtask 3: 51 / 51