Problem:
Given a 2x$N$ matrix,
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
4 | atcoder_official | 158 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 151 |
10 | awoo | 147 |
Need help w/problem! Selects K different column(s) from a 2xN matrix, maximizes the ratio of (sum of selected top) to (sum of selected bottom).
Given a 2x$N$ matrix,
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en24 |
![]() |
3509 | 2020-03-06 05:54:51 | 9 | ||
en23 |
![]() |
3509 | 2020-03-06 03:08:19 | 6 | ||
en22 |
![]() |
3509 | 2020-03-06 01:38:19 | 0 | (published) | |
en21 |
![]() |
3509 | 2020-03-06 01:37:47 | 3 | ||
en20 |
![]() |
3509 | 2020-03-06 01:35:07 | 52 | ||
en19 |
![]() |
3509 | 2020-03-06 01:32:47 | 301 | Tiny change: '>#include <bits/stdc++.h>\nusing n' -> '>#include \<bits/stdc++.h\>\nusing n' | |
en18 |
![]() |
3509 | 2020-03-06 01:24:33 | 2 | Tiny change: '>#include <bits/stdc++.h>\nusing n' -> '>#include \<bits/stdc++.h\>\nusing n' | |
en17 |
![]() |
3509 | 2020-03-06 01:23:46 | 8 | ||
en16 |
![]() |
3509 | 2020-03-06 01:22:55 | 6 | Tiny change: 'raint:_ $1 <= K <= N <= 5*10^4$\n\' -> 'raint:_ $1\leqK\leqN\leq5*10^4$\n\' | |
en15 |
![]() |
3509 | 2020-03-06 01:22:37 | 24 | Tiny change: 'raint:_ $1 <= K <= N <= 5*10^4$\n\' -> 'raint:_ $1\leqK\leqN\leq5*10^4$\n\' | |
en14 |
![]() |
3509 | 2020-03-06 01:22:05 | 7 | ||
en13 |
![]() |
3509 | 2020-03-06 01:21:32 | 85 | ||
en12 |
![]() |
3509 | 2020-03-06 01:19:50 | 76 | ||
en11 |
![]() |
3509 | 2020-03-06 01:19:04 | 34 | ||
en10 |
![]() |
3509 | 2020-03-06 01:18:35 | 24 | ||
en9 |
![]() |
3509 | 2020-03-06 01:18:14 | 14 | ||
en8 |
![]() |
3509 | 2020-03-06 01:17:39 | 98 | ||
en7 |
![]() |
3509 | 2020-03-06 01:16:30 | 12 | ||
en6 |
![]() |
3509 | 2020-03-06 01:16:08 | 28 | ||
en5 |
![]() |
3509 | 2020-03-06 01:15:38 | 21 | ||
en4 |
![]() |
3509 | 2020-03-06 01:14:34 | 181 | ||
en3 |
![]() |
3509 | 2020-03-06 01:10:25 | 2445 | Tiny change: 'ater than , \n' -> 'ater than {10^6} , \n' | |
en2 |
![]() |
3509 | 2020-03-06 00:44:09 | 6 | Tiny change: 'Given a 2x$N$ matrix, \' -> 'Given a 2x**N** matrix, \' | |
en1 |
![]() |
3509 | 2020-03-06 00:43:53 | 182 | Initial revision (saved to drafts) |
Name |
---|