Submission #539723

#	Time	Username	Problem	Language	Result	Execution time	Memory
539723		rk42745417	Financial Report (JOI21_financial)	C++17	14 / 100	4074 ms	1048576 KiB

Main

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

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const ll LINF = ll(4e18) + ll(2e15);
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
static int LamyIsCute = []() {
	EmiliaMyWife
	return 48763;
}();

signed main() {
	int n, d;
	cin >> n >> d;
	vector<int> arr(n), v(n);
	for(int i = 0; i < n; i++) {
		cin >> arr[i];
		v[i] = arr[i];
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for(int &a : arr)
		a = lower_bound(v.begin(), v.end(), a) - v.begin();

	vector<vector<int>> dp(n, vector<int>(v.size(), -INF));
	vector<int> mx(n, -INF);
	for(int j = 0; j < v.size(); j++) {
		for(int i = 0; i < n; i++) {
			if(j == arr[i]) {
				int g = 0;
				for(int k = i - 1; k >= i - d && k >= 0; k--)
					g = max(g, mx[k]);
				dp[i][j] = g + 1;
			}
			if(j >= arr[i] && i)
				dp[i][j] = max(dp[i][j], dp[i - 1][j]);
		}
		for(int i = 0; i < n; i++)
			mx[i] = max(mx[i], dp[i][j]);
	}
	cout << *max_element(dp.back().begin(), dp.back().end()) << '\n';
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:33:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int j = 0; j < v.size(); j++) {
      |                 ~~^~~~~~~~~~

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