git add -p1 2 3 4 5 6 7 8 9 10 11 | y - stage this hunk n - do not stage this hunk q - quit; do not stage this hunk or any of the remaining ones a - stage this hunk and all later hunks in the file d - do not stage this hunk or any of the later hunks in the file g - select a hunk to go to / - search for a hunk matching the given regex j - leave this hunk undecided, see next undecided hunk J - leave this hunk undecided, see next hunk e - manually edit the current hunk ? - print help |
Aba3bd和它的倒序db3abA, 它们的最长公共子序列是b3b, 所以只要最长的公共子序列对齐即可1 2 | A b a 3 b d d b 3 a b A |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | #include <iostream> #include <cstring> using namespace std; int main() { int n; cin >> n; string data; cin >> data; data = " " + data; static short dp[5050][5050]; memset(dp, 0, sizeof(dp)); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (data[i] == data[n - j + 1]) { dp[i][j] = dp[i - 1][j - 1] + 1; } else { dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]); } } } cout << n - dp[n][n] << endl; return 0; } |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 | #include <iostream> #include <cstring> using namespace std; int main() { int n; cin >> n; string data; cin >> data; data = " " + data; int dp[2][5050]; memset(dp, 0, sizeof(dp)); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (data[i] == data[n - j + 1]) { dp[i % 2][j] = dp[(i+1) % 2][j - 1] + 1; } else { dp[i % 2][j] = max(dp[i % 2][j - 1], dp[(i+1) % 2][j]); } } } cout << n - dp[n % 2][n] << endl; return 0; } |
理解这个递推式的核心在于关注胜利者的下标位置是怎么变的, 真是的一语惊醒梦中人f(11, 3)所表达的意思就是说, 11个人每3个人出局, 最终幸存者的位置1 2 3 4 5 6 7 8 9 10 11 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 6 3, 4, 5, 6, 7, 8, 9, 10, 0, 1 3 6, 7, 8, 9, 10, 0, 1, 3, 4 0 9, 10, 0, 1, 3, 4, 6, 7 6 1, 3, 4, 6, 7, 9, 10 3 6, 7, 9, 10, 1, 3 0 10, 1, 3, 6, 7 3 6, 7, 10, 1 0 1, 6, 7 1 1, 6 1 6 0 |
0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 这样的话, 状态是和上一次有关系的, 因为再下一次出局的人是5, 而这个5排在第4个位置(从0开始数), 那我写成上面那样的话, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 这样话, 我就相当与重新开始这样f(N, M) - M是负数的情况1 2 3 4 5 6 7 8 9 10 11 12 13 | #include <iostream> using namespace std; int main() { // f(1, M) = 0 int r = 0, n = 11, m = 3; for (int i = 2; i <= n; ++i) { r = (r + m) % i; } cout << r << endl; return 0; } |
Pull requests, 在Pull requests后, 如何再次添加commits上去Pull requests是绑定你Pull requests的那个分支的, 所以说只要你push commits到你Pull requests上的那个分支就可以了patch-1上修改了内容, 然后Pull requests到别人的仓库, 接下来, 你想继续修改, 直接commits到patch-1这个分支即可commits到别人的Pull requests上Contributor没有取选Allow edits from maintainers就可以修改, 一般情况没人会取选commit里去, 右上角有个像笔一样的图标直接点进去修改提交即可Contributor没有取选Allow edits from maintainers, 那么默认maintainers 就可以修改Pull requests绑定的那一个分支hub, 比用git省很多事, 不用复制用户名, 分支名啥的1 2 3 4 | hub pr list # 列出PR hub pr checkout xx # 要切换到的PR xxx # 这里修改然后commit hub push # push |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | ❯ gpg --expert --edit-key your_id ## 使用专家模式, 不然没有认证的选项 gpg (GnuPG) 2.2.12; Copyright (C) 2018 Free Software Foundation, Inc. This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Secret key is available. sec rsa2048/7DEFA5351BCE3C55 created: 2019-01-07 expires: 2021-01-06 usage: SC trust: ultimate validity: ultimate ssb rsa2048/2FCE923F8ECB63F6 created: 2019-01-07 expires: 2021-01-06 usage: E [ultimate] (1). hhhhh <h@mail.com> gpg> addkey Please select what kind of key you want: (3) DSA (sign only) (4) RSA (sign only) (5) Elgamal (encrypt only) (6) RSA (encrypt only) (7) DSA (set your own capabilities) (8) RSA (set your own capabilities) (10) ECC (sign only) (11) ECC (set your own capabilities) (12) ECC (encrypt only) (13) Existing key Your selection? 8 ## 选8, RSA, 自定义权限 Possible actions for a RSA key: Sign Encrypt Authenticate Current allowed actions: Sign Encrypt ## 这里显示默认有Sign和Encrypt两种权限 (S) Toggle the sign capability (E) Toggle the encrypt capability (A) Toggle the authenticate capability (Q) Finished Your selection? S ## 关闭Sign Possible actions for a RSA key: Sign Encrypt Authenticate Current allowed actions: Encrypt (S) Toggle the sign capability (E) Toggle the encrypt capability (A) Toggle the authenticate capability (Q) Finished Your selection? E ## 关闭Encrypt Possible actions for a RSA key: Sign Encrypt Authenticate Current allowed actions: (S) Toggle the sign capability (E) Toggle the encrypt capability (A) Toggle the authenticate capability (Q) Finished Your selection? A ## 开启Authenticate Possible actions for a RSA key: Sign Encrypt Authenticate Current allowed actions: Authenticate (S) Toggle the sign capability (E) Toggle the encrypt capability (A) Toggle the authenticate capability (Q) Finished Your selection? Q ## 退出 RSA keys may be between 1024 and 4096 bits long. What keysize do you want? (2048) 4096 Requested keysize is 4096 bits Please specify how long the key should be valid. 0 = key does not expire <n> = key expires in n days <n>w = key expires in n weeks <n>m = key expires in n months <n>y = key expires in n years Key is valid for? (0) 1y ## 有效期 Key expires at Tue Jan 7 11:33:54 2020 CST Is this correct? (y/N) y Really create? (y/N) y We need to generate a lot of random bytes. It is a good idea to perform some other action (type on the keyboard, move the mouse, utilize the disks) during the prime generation; this gives the random number generator a better chance to gain enough entropy. sec rsa2048/7DEFA5351BCE3C55 created: 2019-01-07 expires: 2021-01-06 usage: SC trust: ultimate validity: ultimate ssb rsa2048/2FCE923F8ECB63F6 created: 2019-01-07 expires: 2021-01-06 usage: E ssb rsa4096/19D32A8839DCAA1F created: 2019-01-07 expires: 2020-01-07 usage: A [ultimate] (1). hhhhh <h@mail.com> gpg> save ## 保存 |
1 2 3 | export GPG_TTY=$(tty) export SSH_AUTH_SOCK=$(gpgconf --list-dirs agent-ssh-socket) echo UPDATESTARTUPTTY | gpg-connect-agent 1> /dev/null |
1
| enable-ssh-support
|
~/.gnupg/gpg-agent.conf1 2 3 4 5 6 7 8 9 10 11 | ❯ gpg -k --with-keygrip /Users/root/.gnupg/pubring.kbx ----------------------------- pub rsa2048 2019-01-07 [SC] [expires: 2021-01-06] 8A9FC025A44AA4824C1F4AE27DEFA5351BCE3C55 Keygrip = BEFCCDFE36CC5442B888B8459265C68B60A4ABD2 uid [ultimate] hhhhh <h@mail.com> sub rsa2048 2019-01-07 [E] [expires: 2021-01-06] Keygrip = 422922ACFD099E79863D93B93333528F225C90FC sub rsa4096 2019-01-07 [A] [expires: 2020-01-07] Keygrip = 999A87A51CFE82DAA494BEB42F585051307F9E33 |
999A87A51CFE82DAA494BEB42F585051307F9E33~/.gnupg/sshcontrolssh-add -l, 查看是否有加入gpg --export-ssh-key yourid导出ssh key放到你的服务器上的~/.ssh/authorized_keys中