yu121380的博客

A - Salty Fish FZU - 2253海边躺着一排咸鱼，一些有梦想的咸鱼成功翻身（然而没有什么卵用），一些则是继续当咸鱼。一个善良的渔夫想要帮这些咸鱼翻身，但是渔夫比较懒，所以只会从某只咸鱼开始，往一个方向，一只只咸鱼翻过去，翻转若干只后就转身离去，深藏功与名。更准确地说，渔夫会选择一个区间[L,R]，改变区间内所有咸鱼的状态，至少翻转一只咸鱼。渔夫离开后想知道如果

 Problem 1914 Funny Positive SequenceAccept: 510    Submit: 2275Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionThere are n integers a1,a2,…,an-1,an in the sequence A, the s...

Problem 1775 Counting Binary TreesAccept: 92    Submit: 296Time Limit: 3000 mSec    Memory Limit : 32768 KB Problem DescriptionThere are 5 distinct binary trees of 3 nodes:Let T(n) be the n...

E - Cutting Game Fat brother and Maze are playing a kind of special (hentai) game with a piece of gold of length N where N is an integer. Although, Fat Brother and Maze can buy almost everything

C - Card Game (Third Edition) Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card deck

B - Card Game (Second Edition)Fat brother and Maze are playing a kind of special (hentai) game with some cards. In this game, every player gets N cards at first and these are their own card deck.

A - Card Game (First Edition) Fat brother and Maze are playing a kind of special (hentai) game with some cards. There are N*2 cards in this game for the players to use, this is the card deck. Th

G - Card Game FZU - 2260 有如下取牌游戏：1. 桌面上有n张卡牌从左到右排成一行，每张卡牌上有一个数字；2. 游戏按轮次进行，每一轮中取掉所有比左边数值小的卡牌；3. 当无牌可取的时候则游戏结束。比如初始卡牌为{5, 6, 3, 7, 4, 1, 2}，共需2轮取牌。取牌过程如下（小括号为每轮取掉的牌）：{5, 6, 3, 7, 4, 1

F - 奖励 FZU - 2258 福州大学某班共有n名学生，这些学生这学期都选修了3门课，分别是大物、高数、大英。YellowStar想对这学期总绩点不低于3.0的学生进行奖励，所以他将每名学生每门课程的分数告诉你，并希望你能告诉他他必须对多少名学生进行奖励。对于单门课程的绩点计算方法是(分数/10-5)，如分数是69，那么绩点就是1.9，学生的总绩点就是他每门课程的绩点的平

给一个长度为n（n <= 10^5）的“01”串，你可以任意交换一个为0的位和一个为1的位，若这两位相邻，花费为X，否则花费为Y。求通过若干次交换后将串中的“1”全部变换到“0”前面的最小花费。 Input 第一行一个整数T（1 <= T <= 10），表示测试数据的组数。接下来3*T行，每组数据三行，第一行为整数X（1 <= X <= 10^3），第二行为整数Y(X <= Y <= 10^3)