| 20161 | 2026-01-03 14:20:55 | herczegkat | Két ajándék | cpp17 | Time limit exceeded 40/100 | 588ms | 1308 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int db;
cin >> db;
vector<int> eredeti(db);
for (int i = 0; i < db; i++) {
cin >> eredeti[i];
}
vector<int> parH(db, 0);
vector<int> parE(db, 0);
bool vanelottekisebb = false;
for (int i = db - 1; i >= 1; i--) {
vector<int> mxkeresE;
vector<int> mxkeresH;
for (int j = i - 1; j >= 0; j--) {
if (eredeti[i] > eredeti[j]) {
vanelottekisebb = true;
mxkeresE.push_back(eredeti[i] + eredeti[j]);
mxkeresH.push_back(j);
parE[i] = *max_element(mxkeresE.begin(), mxkeresE.end());
parH[i] = mxkeresH[
distance(mxkeresE.begin(),
find(mxkeresE.begin(), mxkeresE.end(), parE[i]))
];
}
}
}
if (!vanelottekisebb) {
cout << "0 0" << endl;
} else {
int ajandek2 = distance(
parE.begin(),
max_element(parE.begin(), parE.end())
);
int ajandek1 = parH[ajandek2];
cout << ajandek1 + 1 << " " << ajandek2 + 1 << endl;
}
return 0;
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Time limit exceeded | 579ms | 1172 KiB | ||||
| subtask2 | 10/10 | ||||||
| 3 | Accepted | 1ms | 508 KiB | ||||
| 4 | Accepted | 1ms | 500 KiB | ||||
| 5 | Accepted | 1ms | 316 KiB | ||||
| 6 | Accepted | 1ms | 316 KiB | ||||
| 7 | Accepted | 1ms | 316 KiB | ||||
| subtask3 | 10/10 | ||||||
| 8 | Accepted | 1ms | 320 KiB | ||||
| 9 | Accepted | 1ms | 552 KiB | ||||
| 10 | Accepted | 1ms | 500 KiB | ||||
| 11 | Accepted | 1ms | 316 KiB | ||||
| 12 | Accepted | 1ms | 316 KiB | ||||
| subtask4 | 20/20 | ||||||
| 13 | Accepted | 1ms | 508 KiB | ||||
| 14 | Accepted | 1ms | 316 KiB | ||||
| 15 | Accepted | 1ms | 316 KiB | ||||
| 16 | Accepted | 1ms | 508 KiB | ||||
| 17 | Accepted | 1ms | 316 KiB | ||||
| 18 | Accepted | 1ms | 316 KiB | ||||
| 19 | Accepted | 1ms | 508 KiB | ||||
| 20 | Accepted | 1ms | 500 KiB | ||||
| 21 | Accepted | 1ms | 316 KiB | ||||
| 22 | Accepted | 1ms | 316 KiB | ||||
| subtask5 | 0/10 | ||||||
| 23 | Time limit exceeded | 570ms | 316 KiB | ||||
| 24 | Time limit exceeded | 570ms | 316 KiB | ||||
| 25 | Time limit exceeded | 570ms | 528 KiB | ||||
| 26 | Time limit exceeded | 572ms | 316 KiB | ||||
| 27 | Time limit exceeded | 579ms | 756 KiB | ||||
| subtask6 | 0/10 | ||||||
| 28 | Time limit exceeded | 579ms | 564 KiB | ||||
| 29 | Time limit exceeded | 579ms | 644 KiB | ||||
| 30 | Time limit exceeded | 579ms | 640 KiB | ||||
| 31 | Time limit exceeded | 580ms | 648 KiB | ||||
| 32 | Time limit exceeded | 574ms | 756 KiB | ||||
| subtask7 | 0/10 | ||||||
| 33 | Time limit exceeded | 578ms | 820 KiB | ||||
| 34 | Time limit exceeded | 577ms | 1012 KiB | ||||
| 35 | Time limit exceeded | 577ms | 820 KiB | ||||
| 36 | Time limit exceeded | 577ms | 828 KiB | ||||
| 37 | Time limit exceeded | 583ms | 964 KiB | ||||
| subtask8 | 0/30 | ||||||
| 38 | Time limit exceeded | 584ms | 1268 KiB | ||||
| 39 | Time limit exceeded | 584ms | 1092 KiB | ||||
| 40 | Time limit exceeded | 584ms | 1196 KiB | ||||
| 41 | Time limit exceeded | 584ms | 1092 KiB | ||||
| 42 | Time limit exceeded | 578ms | 1084 KiB | ||||
| 43 | Time limit exceeded | 578ms | 1148 KiB | ||||
| 44 | Time limit exceeded | 579ms | 1188 KiB | ||||
| 45 | Time limit exceeded | 579ms | 1308 KiB | ||||
| 46 | Time limit exceeded | 588ms | 1200 KiB | ||||
| 47 | Time limit exceeded | 588ms | 1188 KiB | ||||
| 48 | Time limit exceeded | 588ms | 1192 KiB | ||||
| 49 | Time limit exceeded | 588ms | 1164 KiB | ||||
| 50 | Time limit exceeded | 579ms | 1272 KiB | ||||
| 51 | Time limit exceeded | 580ms | 1264 KiB | ||||
| 52 | Time limit exceeded | 580ms | 1148 KiB | ||||