C++博客-止于自娱-最新评论http://www.cppblog.com/yuziyu/CommentsRSS.aspx每天进步一点点,Coding Everyday!zh-cnMon, 27 Jul 2009 06:20:35 GMTMon, 27 Jul 2009 06:20:35 GMTcnblogsre: USACO 3.3 Shopping Offershttp://www.cppblog.com/yuziyu/archive/2009/07/27/89483.html#91337YZYYZYMon, 27 Jul 2009 06:09:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/27/89483.html#91337

YZY 2009-07-27 14:09 发表评论
]]>re: USACO 3.3 Shopping Offershttp://www.cppblog.com/yuziyu/archive/2009/07/27/89483.html#91312我也凑热闹我也凑热闹Mon, 27 Jul 2009 03:18:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/27/89483.html#91312
所以类似
1
1 3 2 5
1
4 2 3
答案应该是6而不是5
对吧？

我也凑热闹 2009-07-27 11:18 发表评论
]]>re: USACO 1.3 Barn Repairhttp://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91281ouyangyuanlingouyangyuanlingSun, 26 Jul 2009 14:18:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91281

ouyangyuanling 2009-07-26 22:18 发表评论
]]>re: USACO 1.3 Barn Repair[未登录]http://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91263YZYYZYSun, 26 Jul 2009 12:08:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91263

YZY 2009-07-26 20:08 发表评论
]]>re: USACO 1.3 Barn Repairhttp://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91234ouyangyuanlingouyangyuanlingSun, 26 Jul 2009 03:22:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/26/86899.html#91234

ouyangyuanling 2009-07-26 11:22 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89111YZYYZYThu, 02 Jul 2009 14:02:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89111呵呵，你说的也有道理，以前我也附过题目，后来就懒得添加了。毕竟题目一般挺长的，添加上后面也不是很好看。附链接的话，是需要usaco的账号才能打开的。

YZY 2009-07-02 22:02 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89109ContaxContaxThu, 02 Jul 2009 13:11:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89109
细节决定成败，个人仅仅以工程的角度来看待这个问题，相信楼上的抱怨和我是一样的心情。

Contax 2009-07-02 21:11 发表评论
]]>re: USACO 3.1 Stamps[未登录]http://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89036YZYYZYThu, 02 Jul 2009 01:06:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/02/88924.html#89036题目就是USACO啊。。USACO是美国给高中生的一个OI训练题库。网上搜一下USACO就知道了。

YZY 2009-07-02 09:06 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#89029ContaxContaxWed, 01 Jul 2009 14:22:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#89029

Contax 2009-07-01 22:22 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#89012Khan's NotebookKhan's NotebookWed, 01 Jul 2009 09:58:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#89012你给一个答案之前都要让人知道问题是什么吧.

Khan's Notebook 2009-07-01 17:58 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88960YZYYZYWed, 01 Jul 2009 01:09:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88960:-). 不好意思,以后不发首页了吧。貌似cppblog中做算法的人不多

YZY 2009-07-01 09:09 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88959kuailekabakuailekabaWed, 01 Jul 2009 00:59:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88959

kuailekaba 2009-07-01 08:59 发表评论
]]>re: USACO 3.1 Stampshttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88958Kevin LynxKevin LynxWed, 01 Jul 2009 00:55:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/07/01/88924.html#88958

Kevin Lynx 2009-07-01 08:55 发表评论
]]>re: MaximumPalindromeScore (有道难题复赛400)http://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88463止于自娱止于自娱Wed, 24 Jun 2009 14:19:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88463是的:-)

止于自娱 2009-06-24 22:19 发表评论
]]>re: MaximumPalindromeScore (有道难题复赛400)http://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88459xiao7cnxiao7cnWed, 24 Jun 2009 14:02:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88459
import java.util.*;

public class MaximumPalindromeScore {

public int maximize(String word, int maxChanges) {
int L = word.length();
int score = 1;
while (L % 2 == 0) {
L /= 2;
score++;
}
int change = Integer.MAX_VALUE;
score++;
int[] stat = new int[26];

while (change > maxChanges && L <= word.length()) {
score--;
change = 0;
int p = 0, q = L - 1;
while (p <= q) {
Arrays.fill(stat, 0);
for (int j = 0; j < word.length() - q; j += L) {
stat[word.charAt(p + j) - 'a']++;
stat[word.charAt(q + j) - 'a']++;
}
int max_char = 0;
for (int ii = 0; ii < stat.length; ii++)
if (stat[max_char] < stat[ii])
max_char = ii;
if (p != q)
change += word.length() * 2 / L - stat[max_char];
else
change += word.length() / L - stat[max_char] / 2;

p++;
q--;
}
L *= 2;
}

return change > maxChanges ? score - 1 : score;
}

}


xiao7cn 2009-06-24 22:02 发表评论
]]>re: USACO 2.2 Runaround Numbershttp://www.cppblog.com/yuziyu/archive/2009/06/24/88197.html#88431止于自娱止于自娱Wed, 24 Jun 2009 07:05:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88197.html#88431我这宏没啥用,方便调试而已.

止于自娱 2009-06-24 15:05 发表评论
]]>re: USACO 2.2 Runaround Numbershttp://www.cppblog.com/yuziyu/archive/2009/06/24/88197.html#88429ChenZBChenZBWed, 24 Jun 2009 06:58:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88197.html#88429

ChenZB 2009-06-24 14:58 发表评论
]]>re: MaximumPalindromeScore (有道难题复赛400)http://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88408YZYYZYWed, 24 Jun 2009 00:39:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88408呵呵,我很少上QQ.还是邮件交流比较方便些:-)

YZY 2009-06-24 08:39 发表评论
]]>re: MaximumPalindromeScore (有道难题复赛400)http://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88404goodideagoodideaTue, 23 Jun 2009 16:33:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88318.html#88404邮箱gc063tzf@163.com

goodidea 2009-06-24 00:33 发表评论
]]>re: 郁闷的有道难题http://www.cppblog.com/yuziyu/archive/2009/06/24/88239.html#88403goodideagoodideaTue, 23 Jun 2009 16:15:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/24/88239.html#88403呵呵，你分析的在理，最初我也想用递归的，但是对这个题还是没想好递归的出口，以及准确性，所以就按自己想法写了一片代码。。。。

goodidea 2009-06-24 00:15 发表评论
]]>re: 郁闷的有道难题[未登录]http://www.cppblog.com/yuziyu/archive/2009/06/23/88239.html#88340YZYYZYTue, 23 Jun 2009 01:01:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/23/88239.html#88340我的算法应该是logn*logn的复杂度

YZY 2009-06-23 09:01 发表评论
]]>re: 郁闷的有道难题http://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88326goodideagoodideaMon, 22 Jun 2009 14:38:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88326对了你的第二个题怎么考虑了？也欢迎给我留言

goodidea 2009-06-22 22:38 发表评论
]]>re: 郁闷的有道难题[未登录]http://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88325YZYYZYMon, 22 Jun 2009 14:12:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88325这个算法的复杂度我自己也没办法分析。不过比回溯法生成应该也不会慢。
我看了你的算法,比我快的地方在于后面直接生成010101这样的.这样编码麻烦且容易出错是.我算法log(n)步就可以从1e17到101010101010这样啊

YZY 2009-06-22 22:12 发表评论
]]>re: 郁闷的有道难题http://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88324goodideagoodideaMon, 22 Jun 2009 14:04:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88324http://gc063tzf.blog.163.com
可以交流一下，我大三，学机械的，不过对编程还有点兴趣

goodidea 2009-06-22 22:04 发表评论
]]>re: 郁闷的有道难题[未登录]http://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88310YZYYZYMon, 22 Jun 2009 10:59:00 GMThttp://www.cppblog.com/yuziyu/archive/2009/06/22/88239.html#88310呵呵，我硕士快毕业了。

YZY 2009-06-22 18:59 发表评论
]]>