随笔分类 - 动态规划
摘要：Problem Description One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo's path to escape from the museum. But
阅读全文
摘要：Description XiaoWei沉迷RPG无法自拔，但是他的战斗力只有5，所以他决定氪金提升战斗力。XiaoWei购买了n个福袋。打开1个福袋后，有以下三种情况出现：1.获得屠龙宝刀，概率为p1；2.获得火麒麟，概率为p2；3.什么都没获得，概率为1-p1-p2；已知每把屠龙宝刀能够使战斗力*
阅读全文
摘要：Description 小M想知道某件物品的重量，但是摆在他面前的只有一个天平（没有游标）和一堆石子，石子可以放左边也可以放右边。他现在知道每个石子的重量。问能不能根据上述条件，能不能测出所问的重量。 小M想知道某件物品的重量，但是摆在他面前的只有一个天平（没有游标）和一堆石子，石子可以放左边也可以
阅读全文
摘要：Problem Description 度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗起来。 邪恶大魔王的麾下有n个怪兽，每个怪兽有a[i]的生命值，以及b[i]的防御力。 度度熊一共拥有m种攻击方式，第i种攻击方式，需要消耗k[i]的晶石，造成p[i]点伤害。 当然，如果度度熊使用第i个技能打在第
阅读全文
摘要：Mahmoud and Ehab live in a country with n cities numbered from 1 to n and connected by n - 1 undirected roads. It's guaranteed that you can reach any
阅读全文
摘要：Mahmoud wrote a message s of length n. He wants to send it as a birthday present to his friend Moaz who likes strings. He wrote it on a magical paper
阅读全文
摘要：如果一个序列有奇数个正整数组成，不妨令此序列为a 1 ,a 2 ,a 3 ,...,a 2∗k+1 (0<=k )，并且a 1 ,a 2 ...a k+1 是一个严格递增的序列，a k+1 ,a k+2 ,...,a 2∗k+1 ,是一个严格递减的序列，则称此序列是A序列。 比如1 2 5 4 3就
阅读全文
摘要：Description Bear Limak prepares problems for a programming competition. Of course, it would be unprofessional to mention the sponsor name in the state
阅读全文
摘要：Description A tree is an undirected connected graph without cycles. The distance between two vertices is the number of edges in a simple path between
阅读全文
摘要：A - Remaining Time Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Dolphin loves programming contests. Today, he will ta
阅读全文
摘要：Description Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you
阅读全文
