Submission #973573

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
973573	2024-05-02T07:30:23 Z	TAhmed33	Global Warming (CEOI18_glo)	C++	15 / 100	2000 ms	3504 KB

glo

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 25;
int n, x, a[MAXN], dp[MAXN];
int LIS () {
	for (int i = 1; i <= n; i++) {
		dp[i] = 0;
		for (int j = 1; j < i; j++) {
			if (a[j] < a[i]) {
				dp[i] = max(dp[i], dp[j]);
			}
		}
		dp[i]++;
	}
	return *max_element(dp + 1, dp + n + 1);
}
void solve () {
	cin >> n >> x;
	for (int i = 1; i <= n; i++) cin >> a[i];
	int mx = 0;
	for (int i = -x; i <= x; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= j; k++) {
				a[k] += i;
			}
			mx = max(mx, LIS());
			for (int k = 1; k <= j; k++) {
				a[k] -= i;
			}
		}
	}
	cout << mx << '\n';
}
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int t = 1; //cin >> t;
	while (t--) solve();
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	9 ms	348 KB	Output is correct
15	Correct	3 ms	348 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	9 ms	348 KB	Output is correct
15	Correct	3 ms	348 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Execution timed out	2048 ms	348 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2032 ms	3504 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2024 ms	1720 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2003 ms	2164 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	9 ms	348 KB	Output is correct
15	Correct	3 ms	348 KB	Output is correct
16	Correct	3 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Execution timed out	2048 ms	348 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-