{"push_id":1718942858,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"685d222bf721485fa10590919aa1129ca6ce2e6d","before":"46f76b928134572d770832fa08cb6636925511da","commits":[{"sha":"f9a26e42fa9c1b4f7d6d08a95b3976d197f6aebc","author":{"name":"Treee","email":"b96e1a961b7ce7b553463c46be13be2a4ddc2bdf@gmail.com"},"message":"【水】http://codeforces.com/contest/803\n\nA\n题意：n维矩阵放k个1，使得此矩阵按照主对角线对称（按照从上到下一次摆放）\n\nB\n题意：一串数字，其中有0，输出非零数距离0的最小距离。","distinct":true,"url":"https://api.github.com/repos/justtreee/Github-ACM/commits/f9a26e42fa9c1b4f7d6d08a95b3976d197f6aebc"},{"sha":"685d222bf721485fa10590919aa1129ca6ce2e6d","author":{"name":"Treee","email":"b96e1a961b7ce7b553463c46be13be2a4ddc2bdf@gmail.com"},"message":"【二分】http://codeforces.com/contest/803/problem/C\n\n题意：输入k和一串带空格和连接符的字符串，将字符串按照连接符或单词（也就是空格）分隔为小于等于k段，使得分割出来的最长字符串长度最短。\n\n思路：针对目标答案二分，最长是原字符长度，最短为0（当然不会），按照二分得到的区间长度，进行如下判断：从原字符开头开始，在满足规则的情况下，按照区间长度分段（也就是说实际长度会小于等于区间长度），记下分段数，与k对比。若小于等于k，则说明段数可以增加，长度可以再短，也就是区间长度可以再二分变短。\n\n注意：bin的判断跳出","distinct":true,"url":"https://api.github.com/repos/justtreee/Github-ACM/commits/685d222bf721485fa10590919aa1129ca6ce2e6d"}]}
{"actor":{"display_login":"justtreee"}}