ACM DP
Astralis的Xyp9x本 人
这个作者很懒,什么都没留下…
展开
-
ACM DP Piggy-Bank
题目:Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is sim...原创 2018-07-08 12:05:58 · 173 阅读 · 0 评论 -
ACM DP Ignatius and the Princess IV
题目:"OK, you are not too bad, em... But you can never pass the next test." feng5166 says. "I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to ...原创 2018-07-08 12:13:57 · 95 阅读 · 0 评论 -
ACM DP Monkey and Banana
题目:A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the m...原创 2018-07-08 12:29:03 · 96 阅读 · 0 评论 -
ACM DP 免费馅饼
题目:都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特...原创 2018-07-08 22:15:23 · 224 阅读 · 0 评论 -
ACM DP Tickets
题目:Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early...原创 2018-07-08 22:29:09 · 225 阅读 · 0 评论 -
ACM DP 最少拦截系统
题目:某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹. 怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截...原创 2018-07-08 22:52:57 · 162 阅读 · 0 评论 -
ACM DP FatMouse's Speed
题目:FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a seque...原创 2018-07-08 23:22:06 · 140 阅读 · 0 评论 -
ACM DP FatMouse and Cheese
题目:FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid...原创 2018-07-08 23:49:32 · 147 阅读 · 0 评论 -
矩阵嵌套(DAG)
题目: 见紫书; 思路都是根据紫书来的,然后重点是学习了一下利用结构体自定义矩阵的方法,这个方法确实比直接两两比较是否能够嵌套优化了很多; 大佬的代码:https://blog.csdn.net/lilele12211104/article/details/52524171 菜鸡的代码: #include<stdio.h> #include<algorithm> ...原创 2018-09-15 10:24:37 · 654 阅读 · 0 评论