QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #375985 | #3720. Longest Increasing Subsequence | Nothing to lose anymore (Guoxin Rui, Bingde Ma, Long Lu) | AC ✓ | 211ms | 3720kb | C++17 | 1.4kb | 2024-04-03 19:16:39 | 2024-04-03 19:16:40 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 211ms
memory: 3720kb
input:
5000 2 10 12 15 16 19 20 21 23 25 26 27 28 31 32 35 36 38 39 41 43 46 47 48 50 53 54 58 59 60 61 62 63 66 67 68 69 70 72 74 76 78 84 87 88 90 91 92 93 94 95 97 98 99 100 102 103 105 106 107 108 109 110 111 112 113 114 116 117 118 119 120 121 123 125 126 129 130 131 133 137 138 141 143 144 146 148 15...
output:
7547072 7547129 7547129 7547129 7547129 7547089 7547089 7547089 7547125 7547125 7547125 7547125 7547125 7547125 7547125 7547125 7547125 7547024 7547024 7546985 7546944 7547880 7547880 7547880 7547865 7547761 7547761 7547688 7547688 7547688 7547688 7547688 7547688 7547808 7547808 7547808 7547808 7547...
result:
ok 50000 numbers