<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
	<channel>
		<title>블로그는 귀차니즘: Maximum-Sum에 달린 최근 댓글/트랙백 목록</title>
		<link>http://www.filewiki.net/tc/</link>
		<description>First Sensation</description>
		<language>ko</language>
		<pubDate>Wed, 19 Nov 2008 19:37:07 +0900</pubDate>
		<generator>Textcube 1.7.5 : Risoluto</generator>
		<image>
		<title>블로그는 귀차니즘: Maximum-Sum에 달린 최근 댓글/트랙백 목록</title>
		<url>http://www.filewiki.net/tc/attach/1/1381453499.png</url>
		<link>http://www.filewiki.net/tc/</link>
		<width>190</width>
		<height>253</height>
		<description>First Sensation</description>
		</image>
		<item>
			<title>Maximum sum</title>
			<link>http://www.filewiki.net/tc/entry/Maximum-Sum#trackback1</link>
			<description>문제 페이지 귀차니스트 님이 푸신 답을 조금 개선해 봤다. 자동채점 기준으로 수행 시간이 0.4초 정도 줄었다. #include &amp;lt;stdio.h&amp;gt; short m[101][101][101][101]={}; int main(void) { int rsum, lsum, nrsm, nlsm; int si, sj, ei, ej, size,i,j; int maxsum = -2000000; scanf(&amp;quot;%d&amp;quot;, &amp;amp;size); for (i=1; i&amp;lt;=size; i+..</description>
			<author>(티스토리 지점)</author>
			<guid>http://www.filewiki.net/tc/entry/Maximum-Sum#trackback1</guid>
			<comments>http://www.filewiki.net/tc/entry/Maximum-Sum#trackback</comments>
			<pubDate>Wed, 09 Apr 2008 14:22:25 +0900</pubDate>
		</item>
	</channel>
</rss>
