제출 #501930

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
501930	2022-01-04 19:40:44	nighty	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	77 / 100	3035 ms	38632 KiB

sortbooks

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 <bits/stdc++.h>
using namespace std;
int calcMaxInv(vector<int>& a, int l, int r) {
    int maxVal = 0, res = 0;
    for (int i = l; i <= r; ++i) {
        if (maxVal > a[i]) {
            res = max(res, maxVal + a[i]);
        }
        maxVal = max(maxVal, a[i]);
    }
    return res;
}
const int K = 470;
const int N = 1e6;
vector<int> s[N / K + 10];
int maxInverse[N / K + 10];
int calcMaxInv2(vector<int>& a, int l, int r) {
    int res = 0, maxVal = 0;
    if (l % K != 0) {
        res = calcMaxInv(a, l, min(r, l - l % K + K - 1));
        maxVal = *max_element(a.begin() + l, a.begin() + l - l % K + K - 1 + 1);
        l = l - l % K + K;
    }
    while (l + K - 1 <= r) {
        res = max(res, maxInverse[l / K]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In member function 'void segtree::build(std::vector<int>&)':
sortbooks.cpp:72:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         while (n < a.size()) {
      |                ~~^~~~~~~~~~
sortbooks.cpp:76:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for (int i = 0; i < a.size(); ++i) {
      |                         ~~^~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 0 / 23