- POST /problemset/submit HTTP/1.1
- Host: codeforces.com
- Connection: keep-alive
- Content-Length: 1927
- Cache-Control: max-age=0
- Origin: http://codeforces.com
- User-Agent: Mozilla/5.0 (Windows NT 6.2; WOW64) AppleWebKit/537.1 (KHTML, like Gecko) Chrome/21.0.1180.60 Safari/537.1
- Content-Type: multipart/form-data; boundary=----WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8
- Referer: http://codeforces.com/problemset/submit
- Accept-Encoding: gzip,deflate,sdch
- Accept-Language: zh-CN,zh;q=0.8
- Accept-Charset: GBK,utf-8;q=0.7,*;q=0.3
- Cookie: lastOnlineTimeUpdaterInvocation=1344171194125; JSESSIONID=C85109C6B25D70475CA3B8FF4EE60DBA; 39ce7=CFt4qOCg; lastOnlineTimeUpdaterInvocation=1344170459183; __utma=71512449.1662834831.1344170219.1344170219.1344170219.1; __utmb=71512449.12.10.1344170219; __utmc=71512449; __utmz=71512449.1344170219.1.1.utmcsr=(direct)|utmccn=(direct)|utmcmd=(none)
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="action"
- submitSolutionFormSubmitted
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="submittedProblemCode"
- 213C
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="programTypeId"
- 1
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="source"
- #include <cstdio>
- #include <cstring>
- #include <algorithm>
- using namespace std;
- int f[320][320][330], N, in[326][320];
- const int INF = 0x3f33ffff;
- int dp(int i, int j, int x);
- int main()
- {
- int i, j, k, y;
- scanf("%d", &N);
- for (i = 0; i <= N; ++i)
- for (j = 0; j <= N; ++j)
- for (k = 0; k <= N; ++k)
- f[i][j][k] = -INF;
- for (i = 1; i <= N; ++i)
- for (j = 1; j <= N; ++j)
- scanf("%d", &in[i][j]);
- f[1][1][1] = in[1][1];
- for (i = 1; i <= N; ++i)
- for (j = 1; j <= N; ++j)
- for (k = 1; k <= N; ++k)
- {
- if (i == 1 && j == 1) continue;
- y = i + j - k;
- if (y < 1) continue;
- f[i][j][k] = -INF;
- f[i][j][k] = max(f[i][j][k], f[i-1][j][k-1]);
- f[i][j][k] = max(f[i][j][k], f[i-1][j][k]);
- f[i][j][k] = max(f[i][j][k], f[i][j-1][k-1]);
- f[i][j][k] = max(f[i][j][k], f[i][j-1][k]);
- f[i][j][k] += in[i][j];
- if (i != k)
- f[i][j][k] += in[k][y];
- }
- printf("%d\n", f[N][N][N]);
- return 0;
- }
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="sourceFile"; filename=""
- Content-Type: application/octet-stream
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx
- Content-Disposition: form-data; name="_tta"
- 760
- ------WebKitFormBoundaryBzoZBsKlBaaJ5uyx--