<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:thr="http://purl.org/syndication/thread/1.0">
  <title type="html">블로그는 귀차니즘: Maximum-Sum에 달린 최근 댓글/트랙백 목록</title>
  <id>http://www.filewiki.net/tc/</id>
  <link rel="alternate" type="text/html" hreflang="ko" href="http://www.filewiki.net/tc/" />
  <subtitle type="html">First Sensation</subtitle>
  <updated>2008-11-25T06:08:32+09:00</updated>
  <generator>Textcube 1.7.5 : Risoluto</generator>
  <entry>
    <title type="html">Maximum sum</title>
    <link rel="alternate" type="text/html" href="http://www.filewiki.net/tc/entry/Maximum-Sum#trackback1" />
    <author>
      <name>(티스토리 지점)</name>
    </author>
    <id>http://www.filewiki.net/tc/entry/Maximum-Sum#trackback1</id>
    <published>2008-04-09T14:22:25+09:00</published>
    <summary type="html">문제 페이지 귀차니스트 님이 푸신 답을 조금 개선해 봤다. 자동채점 기준으로 수행 시간이 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+..</summary>
  </entry>
</feed>
