Comments for Greenmoon55's Blog

Comment on HDU3682 To Be an Dream Architect by EUYUIL

EUYUIL — Wed, 15 Feb 2012 06:41:24 +0000

这种解法真牛逼。

Comment on HDU3687 National Day Parade by ACM/ICPC 2010 杭州现场赛 National Day Parade 题解 ‹ EUYUIL

ACM/ICPC 2010 杭州现场赛 National Day Parade 题解 ‹ EUYUIL — Wed, 15 Feb 2012 06:32:03 +0000

[...] jQuery(document).ready(function($){ if (navigator.platform == "iPad") return; jQuery("img").not(".cycle img").lazyload({ effect:"fadeIn", placeholder: "http://euyuil.com/wp-content/plugins/jquery-image-lazy-loading/images/grey.gif" }); }); MathJax.Hub.Config({ extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["$","$"], ["[latex]","[/latex]"] ], displayMath: [ ['$$','$$'], ["\[","\]"] ], processEscapes: true }, "HTML-CSS": { availableFonts: ["TeX"] } }); LiuyueACM SolutionsSoftware OpusGuestbookSearchAboutACM/ICPC 2010 杭州现场赛 National Day Parade 题解2012-02-15 14:44:19 • ACM, 区域赛, 水题, 现场赛, 题解 • 抢沙发这是在 Greenmoon55′s Blog 挖掘出来的水题一则。果断凑数。思路是把每行的学生的列坐标分别排序，枚举左边一列的列号即可。代码如下：#crayon-4f3b544841637 .crayon-plain { font-size: 12px !important; line-height: 16px !important;}123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include #include #include #include #include #include using namespace std;const int N = 222;int i2j[N][N], cnt[N], n, m, n2;int main(){ // freopen("input.txt", "r", stdin); while (cin >> n >> m) { if (n == 0 && m == 0) break; memset(cnt, 0, sizeof cnt); n2 = n * n; for (int i = 0; i < n2; ++i) { int k, a; cin >> k; –k; cin >> a; –a; i2j[k][cnt[k]++] = a; } for (int i = 0; i < n; ++i) sort(i2j[i], i2j[i] + n); int rmost = m – n, sum, result = INT_MAX; for (int i = 0; i <= rmost; ++i) { sum = 0; for (int j = 0; j < n; ++j) for (int k = 0; k < n; ++k) sum += abs(i2j[j][k] – (i + k)); result = min(result, sum); } cout << result << endl; } return 0;}原创文章，转载请注明来源：http://euyuil.com/3245/acm-icpc-2010-hangzhou-national-day-parade/ 搜索框载入中…… google.load('search', '1', {language : 'zh-CN'}); google.setOnLoadCallback(function() { var customSearchControl = new google.search.CustomSearchControl('001309449942216446108:hg0oww9xcq0'); customSearchControl.setResultSetSize(google.search.Search.FILTERED_CSE_RESULTSET); var options = new google.search.DrawOptions(); options.setAutoComplete(true); options.enableSearchboxOnly("http://euyuil.com/search/", "keyword"); customSearchControl.draw('cse-search-form', options); }, true); [...]

Comment on Guestbook by 纳米黑客

纳米黑客 — Mon, 13 Feb 2012 03:50:44 +0000

神牛来换链接

Comment on HDU4121 Xiangqi by EUYUIL

EUYUIL — Mon, 06 Feb 2012 08:57:58 +0000

共勉啊~！

Comment on Guestbook by 包子剑客

包子剑客 — Sun, 05 Feb 2012 15:05:27 +0000

看我邮箱就知道了。。。。。。

这验证又来了。。。。。

Comment on Guestbook by Greenmoon55

Greenmoon55 — Sun, 05 Feb 2012 15:04:14 +0000

这个名字好熟悉呀～在好多地方见过好多次。。
嗯，确实应该考虑换验证码了= =

Comment on Guestbook by 包子剑客

包子剑客 — Sat, 04 Feb 2012 16:40:40 +0000

I found you！
还有还有，换个机器人验证。。。。。。。做数学加法那种多好的。。。。。。。

Comment on 用字符数组存int by EUYUIL

EUYUIL — Mon, 26 Dec 2011 03:47:14 +0000

看看这篇……

http://euyuil.com/3023/

Comment on 用字符数组存int by EUYUIL

EUYUIL — Tue, 13 Dec 2011 16:38:23 +0000

呵呵，发现有提到我……

这个似乎有的是从低位存到高位，有的是反过来的。比如 Java 似乎是反的，它在读取二进制文件的时候就是反的，写项目的时候就以为它也是从低位到高位存，所以就搞错了。

听说 Intel 的处理器还是什么的比较喜欢这样搞，具体忘了。

还有 TCHAR 的定义是这样的：如果你定义了 UNICODE 那么 TCHAR 就是 wchar_t, 如果你没有定义的话就是 char. 如果你用 VS 2010 来弄的话，默认是定义了 UNICODE 的。

Comment on 20111101 by EUYUIL

EUYUIL — Sun, 13 Nov 2011 06:57:39 +0000

其实以前软院没有那么苦逼的，一个学期就一两个项目罢了。