UVa OJ
文章平均质量分 88
ProLightsfxjh
这个作者很懒,什么都没留下…
展开
-
UVA 1626 Brackets sequence dp:经典&&类似于三角剖分
Let us define a regular brackets sequence in the following way: Empty sequence is a regular sequence. If S is a regular sequence, then (S) and [S] are both regular sequences. If A and B are regular sequences, then AB is a regular sequence. For example, all原创 2016-02-27 22:34:26 · 995 阅读 · 0 评论 -
UVA 315 Network 求割点、套版题 求割点
求割点的个数 套一个求割点和桥模板 然后注意一下边的读入 因为每行不确定多少个数字, 所以用getline() 然后用 isalnum() 来判断是数字还是空格 此外注意这里val < 100, 所以可能有两位数 这样就要 if(i + 1 < sz && isalnum(ss[i+1])){ v = 10*(ss[i] - '0') + ss[i+1] - '0'; i++; } else v = ss[i] - '0'; 然后这里是无原创 2016-07-26 02:12:11 · 1604 阅读 · 1 评论 -
UVa 12563 Jin Ge Jin Qu hao dp : 0-1背包问题
(If you smiled when you see the title, this problem is for you ^_^) For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_box There is one very popular song called Jin Ge Jin Qu(). It is a mix of 37 songs, and is extremely long (1原创 2016-02-24 17:29:19 · 1745 阅读 · 0 评论 -
UVa 10003 Cutting Sticks dp : 线性dp triangulation三角剖分
You have to cut a wood stick into pieces. The most affordable company, The Analog Cutting Machinery, Inc. (ACM), charges money according to the length of the stick being cut. Their procedure of work requires that they only make one cut at a time. It is eas原创 2016-02-28 11:29:16 · 808 阅读 · 0 评论 -
UVa 11584 Partitioning by Palindromes dp : 线性结构上dp LIS
A partition of a sequence of characters is a list of one or more disjoint non-empty groups of consecutive characters whose concatenation yields the initial sequence. For example, (‘race’, ‘car’) is a partition of ‘racecar’ into two groups. Given a sequence原创 2016-02-26 19:16:53 · 840 阅读 · 0 评论 -
UVa 11400 Lighting System Design dp : 线性结构上dp LIS
You are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation and sketching, you have figured out the requirements for an energy-efficient design that can properly illuminate the entire hall. According to y原创 2016-02-25 20:25:23 · 1130 阅读 · 0 评论 -
UVa 11997 K Smallest Sums 优先队列&&打有序表&&归并
You’re given k arrays, each array has k integers. There are k k ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k smallest sums among them.原创 2016-03-05 13:58:16 · 1751 阅读 · 1 评论 -
UVa 1218 Perfect Service dp:树上dp && 状态转移方程的优化
A network is composed of N computers connected by N - 1 communication links such that any two computers can be communicated via a unique route. Two computers are said to be adjacent if there is a communication link between them. The neighbors of a computer原创 2016-03-04 16:04:54 · 966 阅读 · 0 评论 -
UVa 1220 Party at Hali-Bula dp:树的最大独立集
Dear Contestant, I'm going to have a party at my villa at Hali-Bula to celebrate my retirement from BCM. I wish I could invite all my co-workers, but imagine how an employee can enjoy a party when he finds his boss among the guests! So, I decide not to inv原创 2016-03-02 23:31:07 · 1364 阅读 · 0 评论 -
UVa 12186 Another Crisis dp:树上dp
A couple of years ago, a new world wide crisis started, leaving many people with economical problems. Some workers of a particular company are trying to ask for an increase in their salaries. The company has a strict hierarchy, in which each employee has e原创 2016-03-01 18:37:22 · 1024 阅读 · 0 评论 -
UVA - 11475 Extend to Palindrome manacher+贪心
题意:给出一个字符串,在末尾添加尽可能少的字符串,使这个新字符串为回文串,输出新字符串。 manacher+贪心 先用manacher O(n)的跑出原字符串的以每个i为中心的回文子串, 然后应该自己得出的一个manacher的结论if(len[i + j] >= (j - i)/2 + 1) 则字符串s[i......j]为回文子串。 也就是从原串的右边开始,向左跑,找到以sz-1为右端点的最大回文子串,标记为ans开始,则输出原串后,从ans-1开始到0按照顺序每个字符依次输出。 复杂度 O(n)原创 2017-02-16 18:39:15 · 799 阅读 · 0 评论