LPX
文章平均质量分 82
u010761825
这个作者很懒,什么都没留下…
展开
-
分组背包+树形DP(BY LPX)
专题传送门:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=24217#overviewA./*类型:树形DP题意:广播一场比赛,有发射站和用户,用户为叶子节点。每个发射站有消耗,到达用户有收益,现在问在不赔钱的情况下怎样使用户最大思路:dp[i][j] 为给第i个节点分配k个用户的收益(可以为负),显然使dp[1][j]为原创 2013-07-16 22:00:51 · 531 阅读 · 0 评论 -
SGU 100
100. A+Btime limit per test: 0.25 sec. memory limit per test: 65536 KBRead integers A and B from input file and write their sum in output file.InputInput file contains A and B (0OutputWrite answer in原创 2014-03-01 17:28:39 · 380 阅读 · 0 评论 -
Codeforces#232 C
C. On Changing Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a rooted tree consisting原创 2014-03-01 17:57:15 · 483 阅读 · 0 评论 -
SGU 101
101. Dominotime limit per test: 0.25 sec. memory limit per test: 4096 KBDominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots, or p原创 2014-03-01 17:34:16 · 468 阅读 · 0 评论 -
SGU 102
102. Coprimestime limit per test: 0.25 sec. memory limit per test: 4096 KBFor given integer N (1N104) find amount of positive numbers not greater than N that coprime with N. Let us call two原创 2014-03-01 17:36:43 · 377 阅读 · 0 评论 -
Codeforces#232 A
AA. On Number of Decompositions into Multiplierstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou a原创 2014-03-01 17:45:01 · 528 阅读 · 0 评论