# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
833268 |
2023-08-22T03:55:49 Z |
vjudge1 |
Exam (eJOI20_exam) |
C++17 |
|
16 ms |
340 KB |
#include <bits/stdc++.h>
using namespace std;
int n;
int h[100005];
int t[100005];
int dp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
cin >> t[i];
}
// subtask 3
dp[n] = 0;
for (int i = n - 1; i >= 0; i--) {
int maxx = 0, cnt = 0;
for (int j = i; j < n; j++) {
if (t[j] > maxx) {
maxx = t[j];
cnt = 1;
} else if (t[j] == maxx) {
cnt++;
}
dp[i] = max(dp[i], dp[j + 1] + (h[j] == maxx ? cnt : 0));
}
}
cout << dp[0] << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |