{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"Description","value":{"format":"HTML","content":"有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少? \u003cbr\u003e \n\u003cimg style\u003d\"max-width:100%;\" src\u003d\"CDN_BASE_URL/79b65092734d6a263a9280f5b332c5b9?v\u003d1501552325\" SRC\u003d\"CDN_BASE_URL/79b65092734d6a263a9280f5b332c5b9?v\u003d1501552325\"\u003e "}},{"title":"Input","value":{"format":"HTML","content":"输入数据首先包括一个整数C,表示数据的个数。\u003cbr\u003e\n每个测试实例的第一行是一个整数N(1 \u0026lt;\u003d N \u0026lt;\u003d 100),表示数塔的高度,接下来用N行数字表示数塔,其中第i行有个i个整数,且所有的整数均在区间[0,99]内。 \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试实例,输出可能得到的最大和,每个实例的输出占一行。 \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1\n5\n7\n3 8\n8 1 0 \n2 7 4 4\n4 5 2 6 5\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e30\u003c/pre\u003e"}}]}