제출 #1155515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1155515		eyadooz	Global Warming (CEOI18_glo)	C++20	0 / 100	2095 ms	1092 KiB

glo

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <math.h>
#include <array>
#include <random>
#include <bitset>
#include <climits>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define endl '\n'
#define mod 1000000007
#define INF 0x3f3f3f3f

#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,sse3,sse4,avx")
#pragma GCC target("popcnt")

template <class x>
using ordered_set = tree<x, null_type, less<x>, rb_tree_tag, tree_order_statistics_node_update>;

typedef pair<int, int> ipair;

static inline int read()
{
    int x = 0;char ch = getchar();
    while (ch < '0' || ch>'9') ch = getchar();
    while (ch >= '0' && ch <= '9') x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
    return x;
}

static inline void print(const int &x) {
    if (x > 9)print(x / 10);
    putchar('0' + x % 10);
}

int main()
{
    cin.tie(0) -> sync_with_stdio(0);

    int n, x;

    cin >> n >> x;

    int list[n];
    for(int i = 0;i < n;cin >> list[i++]);

    int mx = 0;
    for(int q = 0;q < n;q++)
    {
        for(int j = 0;j <= x;j++)
        {
            list[q] += j;
            vector<int> taken;
            taken.push_back(list[0]);
            for(int i = 1;i < n;i++)
            {
                if(taken.back() >= list[i])
                {
                    auto it = lower_bound(taken.begin(), taken.end(), list[i]) - taken.begin();

                    taken[it] = list[i];
                }
                else
                {
                    taken.push_back(list[i]);
                }
            }

            mx = max((int)taken.size(), mx);
            list[q] -= j;
        }
    }

    cout << mx;
}

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