Submission #36647519

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
#define ll              long long
#define infi            INT_MAX
const long long mod = 1000000007;
#define spc             " "
#define nline            "\n"
#define pii             pair<int,int>
#define all(a)          a.begin(), a.end()
#define print(a)        cout << (a) << nline;
#define print2(a,b)      cout << (a) << " " << (b) << nline;
#define logarr(arr,a,b)    for(int z=(a);z<=(b);z++) cout<<(arr[z])<<" ";cout<<endl;
#define printarr(arr,n) logarr(arr,0,n-1)
#define printmat(arr,r,c) for(int i=(0);i<(r);++i){logarr(arr[i],0,c-1)}
#define rep(i,_srt,_end)      for(int i=(_srt); i < (_end); ++i)


#ifndef ONLINE_JUDGE
    #define bug(...)        __f (#__VA_ARGS__, __VA_ARGS__)
#else
    #define bug(...) ;
#endif

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) {cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
    const char* comma = strchr (names + 1, ',');
    cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...);
}

void file_i_o(){
    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);    
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);
    #endif
}

//---------------------------Hello there----------------------------

const int N = 1e5 + 9;
vector<long long> t;
struct SegmentTree {

    int _n;
    static const long long inf = 1e18;

    SegmentTree() {
        //memset(t, 0, sizeof t);
    }

    void update(int in, int b, int e, int i, long long x) {
        if(b > i || e < i) return;
        if(b == e && b == i){
            t[in] = max(t[in], x);
            return;
        }
        int mid = (b + e) >> 1;
        update(2 * in, b, mid, i, x);
        update(2 * in + 1, mid + 1, e, i, x);
        t[in] = max(t[2 * in], t[2 * in + 1]);
    }

    void update(int i, long long x) {
        update(1, 0, _n, i, x);
    }

    long long query(int in, int b, int e, int l, int r){
        if(b > r || e < l) return 0;
        if(b >= l && e <= r) return t[in];
        int mid = (b + e) >> 1;
        long long L = query(2 * in, b, mid, l, r);
        long long R = query(2 * in + 1, mid + 1, e, l, r);
        return max(L, R);
    }

    long long query(int l, int r){        
        return query(1, 0, _n, l, r);
    }
};
SegmentTree tr;
void solve(){
    int n;
    cin >> n;
    tr._n = n;
    int a[n], b[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    t.resize(4 * n + 5);
    long long ans = 0;
    for (int i = 0; i < n; ++i) {
        int h = a[i];
        long long curr = tr.query(1, h - 1) + b[i];
        tr.update(h, curr);        
        ans = max(ans, curr);

    }
    cout << ans << nline;

}

int32_t main(int32_t argc, char const *argv[]){
    file_i_o();

    clock_t myclock = clock();

    solve();

    //cerr << "Run time: " << ((double)(clock() - myclock)/CLOCKS_PER_SEC) * 1000 << " ms" << endl;

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int32_t main(int32_t, const char**)’:
./Main.cpp:113:13: warning: unused variable ‘myclock’ [-Wunused-variable]
  113 |     clock_t myclock = clock();
      |             ^~~~~~~
./Main.cpp:110:22: warning: unused parameter ‘argc’ [-Wunused-parameter]
  110 | int32_t main(int32_t argc, char const *argv[]){
      |              ~~~~~~~~^~~~
./Main.cpp:110:40: warning: unused parameter ‘argv’ [-Wunused-parameter]
  110 | int32_t main(int32_t argc, char const *argv[]){
      |                            ~~~~~~~~~~~~^~~~~~

Judge Result