#include <algorithm>
#include <vector>
using namespace std;
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
if (N > 5000) return 0;
vector<int> adjlist[N + C], stuff;
for (int i = 0; i < N; ++i) stuff.push_back(i);
for (int i = 0; i < C; ++i) {
for (int j = S[i]; j <= E[i]; ++j) adjlist[N + i].push_back(stuff[S[i]]), stuff.erase(stuff.begin() + S[i]);
stuff.insert(stuff.begin() + S[i], N + i);
}
int dptable[N + C], ans = -1, mx = -1;
for (int i = 0; i < N; ++i) {
int sm = 0;
fill_n(dptable, N + C, -1);
for (int j = 0; j < N; ++j) {
if (j < i) dptable[j] = K[j];
else if (j == i) dptable[j] = R;
else dptable[j] = K[j - 1];
}
for (int j = N; j < N + C; ++j) {
dptable[j] = -1;
for (int k: adjlist[j]) dptable[j] = max(dptable[j], dptable[k]);
if (dptable[j] == R) ++sm;
}
if (sm > mx) sm = mx, ans = i;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
10 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
18 ms |
768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |