Submission #1173223

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173223		DangKhoizzzz	Divide and conquer (IZhO14_divide)	C++17	0 / 100	1 ms	1856 KiB

divide

// luu code de debug

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pii pair <int , int>
#define arr3 array <int , 3>

using namespace std;

const int INF = 1e18 + 7;
const int maxn = 2e5 + 7;

int n , pre[maxn] , pre1[maxn] , pre2[maxn];
arr3 a[maxn];

struct Fenwick_Tree
{
    vector <int> bit;

    void init()
    {
        bit.assign(maxn+5 , INF);
    }

    void update(int pos , int val)
    {
        while(pos <= n)
        {
            bit[pos] = min(bit[pos] , val);
            pos += (pos & (-pos));
        }
    }

    int get(int pos)
    {
        int res = INF;
        while(pos > 0)
        {
            res = min(res , bit[pos]);
            pos -= (pos & (-pos));
        }
        return res;
    }
};

Fenwick_Tree BIT;

vector <int> val;

void compress()
{
    sort(val.begin() , val.end());

    for(int i = 1; i <= n; i++)
    {
        pre1[i] = upper_bound(val.begin() , val.end() , pre1[i]) - val.begin();
        pre2[i] = upper_bound(val.begin() , val.end() , pre2[i]) - val.begin();
    }
}

void solve()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    sort(a+1 , a+n+1);
    BIT.init();

    for(int i = 1; i <= n; i++)
    {
        pre1[i] = (pre[i] - i);
        pre[i] = pre[i-1] + a[i][2];
        pre2[i] = (pre[i] - i);
        val.push_back(pre1[i]);
        val.push_back(pre2[i]);
    }
    compress();

    int preg = 0;
    int ans = 0;

    for(int i = 1; i <= n; i++)
    {
        BIT.update(pre1[i] , preg);

        preg += a[i][1];
        ans = max(ans , preg - BIT.get(pre2[i]));
    }

    cout << ans << '\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52