Submission #910933

#	Time	Username	Problem	Language	Result	Execution time	Memory
910933		vjudge1	Financial Report (JOI21_financial)	C++17	5 / 100	65 ms	8664 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int SZ = 1e6+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n,d;
pii a[SZ];

struct FenwickTree
{
    int nodes[SZ];

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

    int query(int pos)
    {
        int res = 0;
        while(pos > 0)
        {
            res = max(res, nodes[pos]);
            pos -= pos & (-pos);
        }
        return res;
    }
} ft;

int res = 0;

int main()
{
    init();
    cin >> n >> d;
    if(n != d) return 0;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i].fi;
        a[i].se = -i;
    }
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; i++)
    {
        int mx = ft.query(-a[i].se - 1);
        ft.update(-a[i].se, mx + 1);
        res = max(res, mx + 1);
    }
    cout << res;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 5 / 5
• Subtask 6: 0 / 35