Loading

随笔分类 -  解题笔记

摘要:Function "题目链接" Problem Description wls 有 n 个二次函数 Fi(x) = aix2 + bix + ci (1 ≤ i ≤ n). 现在他想在∑ni=1xi = m 且 x 为正整数的条件下求∑ni=1Fi(xi)的最小值。 请求出这个最小值。 Input 阅读全文
posted @ 2019-07-14 20:06 GrayKido 阅读(949) 评论(0) 推荐(2)
摘要:Wall "题目链接" . Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42823 Accepted: 14602 Description Once upon a time there was a greedy King wh 阅读全文
posted @ 2019-07-02 16:44 GrayKido 阅读(305) 评论(0) 推荐(1)
摘要:Covering Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3078 Accepted Submission(s): 1117 Proble 阅读全文
posted @ 2019-05-18 11:22 GrayKido 阅读(218) 评论(0) 推荐(1)
摘要:Queuing Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8207 Accepted Submission(s): 3593 Proble 阅读全文
posted @ 2019-05-17 19:34 GrayKido 阅读(285) 评论(0) 推荐(0)
摘要:题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2314 Reactor CoolingTime Limit: 5 Seconds Memory Limit: 32768 KB Special Judge The t 阅读全文
posted @ 2019-05-15 22:13 GrayKido 阅读(360) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6214 Problem Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition 阅读全文
posted @ 2019-05-11 16:21 GrayKido 阅读(266) 评论(0) 推荐(0)
摘要:某个小镇有 N 个村庄,村庄编号1-N,给出 M 条单向道路,不存在环,即不存在 村庄A可以到达村庄B 且 村庄B也可以到达村庄A的情况。如果村庄A与村庄B之间存在一条单向道路,则说村庄A和村庄B之间存在联系,联系具有无向性,即如果村庄A和村庄B有联系,则村庄B和村庄A有联系;联系具有传递性,即如果 阅读全文
posted @ 2019-05-10 20:38 GrayKido 阅读(458) 评论(0) 推荐(0)
摘要:Wash Wash Mr.Panda is about to engage in his favourite activity doing laundry! He’s brought L indistinguishable loads of laundry to his local laundrom 阅读全文
posted @ 2019-04-25 20:52 GrayKido 阅读(427) 评论(0) 推荐(0)
摘要:In order to understand early civilizations, archaeologists often study texts written in ancient languages. One such language, used in Egypt more than 阅读全文
posted @ 2019-02-21 18:48 GrayKido 阅读(528) 评论(0) 推荐(0)
摘要:Alex has invented a new game for fun. There are n integers at a board and he performs the following moves repeatedly:1. He chooses three numbers a, b  阅读全文
posted @ 2019-02-20 21:17 GrayKido 阅读(292) 评论(0) 推荐(0)