2017年12月_riba2534

原创 Wannafly挑战赛5 A. 珂朵莉与宇宙(思路，枚举完全平方数子区间)

题目描述星神是来自宇宙的所以珂朵莉也是吧所以我就出了个题给你一个长为n的序列a，有n*(n+1)/2个子区间，问这些子区间里面和为完全平方数的子区间个数输入描述: 第一行一个数n 第二行n个数表示序列a输出描述: 输出一个数表示答案示例1输入60 1 0 9 1 0输出11备注: 1 <= n <= 100000 0 <=

2017-12-30 20:09:56 831

原创 POJ1459 Power Network(多源点网络流,最大流,EK算法)

Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may pro

2017-12-30 13:43:15 542

原创 Codeforces-Good Bye 2017 B. New Year and Buggy Bot(模拟)

Describe Bob programmed a robot to navigate through a 2d maze. The maze has some obstacles. Empty cells are denoted by the character ‘.’, where obstacles are denoted by ‘#’. There is a s

2017-12-30 11:33:40 509

原创 Codeforces-Good Bye 2017 C. New Year and Curling(计算几何)

Describe Carol is currently curling. She has n disks each with radius r on the 2D plane. Initially she has all these disks above the line y = 10100. She then will slide the disks towar

2017-12-30 11:24:34 372

原创 POJ1273 Drainage Ditches(网络流--最大流，EK增广路算法)

Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long ti

2017-12-29 17:17:20 612

原创 Code+第一次月赛 B. 汀博尔(二分)

题目描述有 n 棵树，初始时每棵树的高度为 Hi，第 i 棵树每月都会长高 Ai。现在有个木料长度总量为 S 的订单，客户要求每块木料的长度不能小于 L，而且木料必须是整棵树（即不能为树的一部分）。现在问你最少需要等多少个月才能满足订单。输入格式从标准输入读入数据。第一行 3 个用空格隔开的非负整数 n,S,L，表示树的数量、订单总量和单块木料长度限制。第

2017-12-25 09:57:39 446

原创 “科林明伦杯”哈尔滨理工大学第七届程序设计团队赛 I.Aggie’s Tasks(带权的LIS)

Description Aggie is faced with a sequence of tasks, each of which with a difficulty value di and an expected profit pi. For each task, Aggie must decide whether or not to complete it. As Aggie

2017-12-19 19:58:43 626

原创 “科林明伦杯”哈尔滨理工大学第七届程序设计团队赛 A. An Easy Geometry Problem(计算几何)

Description Lily is interested in hyperspace recently, and she is trying to solve an easy problem now. Given an n-dimensional hyperspace, assuming each dimension is a1, a2, a3, …, an. And for e

2017-12-19 15:51:11 387

原创 “科林明伦杯”哈尔滨理工大学第七届程序设计团队赛 G.Sorting(贪心，思路)

Description You have an integer sequence a1 … an (integers are distinct) and you need to sort it by ascending order. However, you can only swap two integers at a time and the cost is (ai + aj)

2017-12-18 23:44:06 426 1

原创 51Nod - 1125 交换机器的最小代价(贪心，思路)

描述有N台机器重量各不相等，现在要求把这些机器按照重量排序，重量从左到右依次递增。移动机器只能做交换操作，但交换机器要花费一定的费用，费用的大小就是交换机器重量的和。例如：3 2 1，交换1 3后为递增排序，总的交换代价为4。给出N台机器的重量，求将所有机器变为有序的最小代价。（机器的重量均为正整数）Input 第1行：1个数N，表示机器及房间的数量。（2 <= N <= 5000

2017-12-18 23:22:10 654

原创 NEU1511 Caoshen like math(使序列有序的最小交换次数)

题目描述 Worfzyq likes Permutation problems.Caoshen and Mengjuju are expert at these problems . They have n cards,and all of the numbers vi on these cards are different . Because Caoshen doesn’t

2017-12-18 20:03:13 2012

原创 POJ2239 Selecting Courses(二分图匹配，匈牙利算法)

Description It is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much,

2017-12-02 18:07:56 396

原创 HDU1251 统计难题(Trie树)

Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行

2017-12-02 17:25:02 474

原创 HDU5239 Doom(线段树，区间更新，区间平方)

Problem Description THE END IS COMINGGGGGG! Mike has got stuck on a mystery machine. If he cannot solve this problem, he will go to his doom. This machine is consist of n cells, and a sc

2017-12-02 12:46:22 671

原创 BZOJ3211 花神游历各国(线段树，区间开根号)

描述InputOutput 每次x=1时，每行一个整数，表示这次旅行的开心度Sample Input41 100 5 551 1 22 1 21 1 22 2 31 1 4Sample Output1011111Hint 对于100%的数据， n ≤ 100000，m≤200000 ,data[i]非负且小于10^9思路题意很好理解，就是给了一段区间，有两种操作，一

2017-12-01 21:23:03 1638

riba2534的博客