제출 #1050096

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050096		anton	Global Warming (CEOI18_glo)	C++17	10 / 100	91 ms	6088 KiB

glo

#include<bits/stdc++.h>

using namespace std;
int N, X;


struct MaxTree{
    int len = 1;
    vector<int> tr;
    MaxTree(int n){
        while(len<n){
            len*=2;
        }
        tr.resize(2*len);
    }

    void upd(int u){
        for(u/=2; u>=1; u/=2){
            tr[u] = max(tr[u*2], tr[u*2+1]);
        }
    }

    int get(int l, int r){
        l += len;
        r+=len+1;
        int res = 0;
        for(; l<r; l/=2, r/=2){
            if(l%2 ==1){
                res = max(res, tr[l++]);
            }
            if(r%2 == 1){
                res = max(res, tr[--r]);
            }
        }
        return res;
    }

    void set(int pos, int val){
        pos+=len;
        tr[pos] = max(tr[pos], val);
        upd(pos);
    }
};

int find_pos(int e, vector<int>& v){
    int pos =0;
    for(int step = (1<<20); step>=1; step/=2){
        if(pos+step<v.size() && v[pos+step]<=e){
            pos+=step;
        }
    }
    return pos;
}

signed main(){
    cin>>N>>X;
    vector<int> t(N);
    vector<int> vals;
    vals.push_back(0);
    for(int i = 0; i<N; i++){
        cin>>t[i];
        vals.push_back(t[i]);
    }


    sort(vals.begin(), vals.end());

    for(int i = 0; i<N; i++){
        t[i] = find_pos(t[i], vals);
    }


    MaxTree tr(vals.size());

    for(int i= 0; i<N; i++){
        int best_under = tr.get(0, t[i]-1);
        tr.set(t[i], best_under+1);
    }

    cout<<tr.get(0, vals.size()-1)<<endl;
}

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

glo.cpp: In function 'int find_pos(int, std::vector<int>&)':
glo.cpp:48:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         if(pos+step<v.size() && v[pos+step]<=e){
      |            ~~~~~~~~^~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 10 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25