Submission #385763

#	Time	Username	Problem	Language	Result	Execution time	Memory
385763		SansPapyrus683	Global Warming (CEOI18_glo)	C++17	28 / 100	2088 ms	1132 KiB

glo

#include <iostream>
#include <vector>
#include <algorithm>

using std::cout;
using std::endl;
using std::vector;

int find_lis(const vector<int>& a) {
	vector<int> dp;
	for (int i : a) {
		int pos = lower_bound(dp.begin(), dp.end(), i) - dp.begin();
		if (pos == dp.size())  // we can have a new, longer increasing subsequence!
			dp.push_back(i);
		else  // oh ok, at least we can make the ending element smaller
			dp[pos] = i;
	}
	return dp.size();
}

int main() {
    int temp_num;
    int max_cheating;
    std::cin >> temp_num >> max_cheating;
    vector<int> temps(temp_num);
    for (int t = 0; t < temp_num; t++) {
        std::cin >> temps[t];
    }
    int longest = 0;
    for (int i = temp_num - 1; i >= 0; i--) {
        temps[i] += max_cheating;
        longest = std::max(longest, find_lis(temps));
    }
    cout << longest << endl;
}

Compilation message (stderr)

glo.cpp: In function 'int find_lis(const std::vector<int>&)':
glo.cpp:13:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   if (pos == dp.size())  // we can have a new, longer increasing subsequence!
      |       ~~~~^~~~~~~~~~~~

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