05 2017 档案

POJ-1860 Currency Exchange 【spfa判负环】
摘要：Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and perf 阅读全文
posted @ 2017-05-19 19:30 Robin! 阅读(305) 评论(0) 推荐(0)
Codeforces-808D Array Division 【multiset】
摘要：Description Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the pr 阅读全文
posted @ 2017-05-16 23:18 Robin! 阅读(636) 评论(0) 推荐(0)
HDU-1556 Color the ball 【差分数组】
摘要：Problem Description N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气 阅读全文
posted @ 2017-05-16 20:03 Robin! 阅读(741) 评论(0) 推荐(0)
ZOJ-2386 Ultra-QuickSort 【树状数组求逆序数+离散化】
摘要：Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping 阅读全文
posted @ 2017-05-15 22:59 Robin! 阅读(230) 评论(0) 推荐(0)
POJ-2195 Going Home 【费用流】
摘要：Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver 阅读全文
posted @ 2017-05-02 20:37 Robin! 阅读(266) 评论(0) 推荐(0)
AHU-743 多重部分和问题 【多重背包变种】
摘要：Description 有n种不同大小的数字，每种各个。判断是否可以从这些数字之中选出若干使它们的和恰好为K。 Input 首先是一个正整数T(1<=T<=100)接下来是T组数据每组数据第一行是一个正整数n(1<=n<=100)，表示有n种不同大小的数字第二行是n个不同大小的正整数ai(1<=ai 阅读全文
posted @ 2017-05-02 13:41 Robin! 阅读(471) 评论(0) 推荐(0)