ecjtu-summer training #5 D - The Triangle POJ - 1163 (动态规划)
2017-07-15 09:05
417 查看
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int san[105][105];
int main()
{
int n,i,j,a;
while(scanf("%d",&n)!=EOF){
memset(san,0,sizeof(san));
scanf("%d",&san[1][1]);
for(i=2;i<=n;i++){
for(j=1;j<=i;j++){
scanf("%d",&san[i][j]);
san[i][j]=max(san[i-1][j-1],san[i-1][j])+san[i][j];
}
}
sort(san
,san
+n+1);
printf("%d\n",san
);
}
}
#include <cstdlib>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int san[105][105];
int main()
{
int n,i,j,a;
while(scanf("%d",&n)!=EOF){
memset(san,0,sizeof(san));
scanf("%d",&san[1][1]);
for(i=2;i<=n;i++){
for(j=1;j<=i;j++){
scanf("%d",&san[i][j]);
san[i][j]=max(san[i-1][j-1],san[i-1][j])+san[i][j];
}
}
sort(san
,san
+n+1);
printf("%d\n",san
);
}
}
相关文章推荐
- POJ 1163 The Triangle - 数字三角形详解
- poj1163 The Triangle
- POJ 1163 The Triangle 典型的递归问题
- poj 1163 The Triangle --dp
- POJ 1163 The Triangle DP 逐点累加
- POJ1163 The Triangle
- POJ 1163 The Triangle + HDU 2084 数塔(递推dp)
- POJ 1163 The Triangle
- poj 1163 The Triangle之解题报告
- POJ 1163 The Triangle
- POJ 1163 The Triangle 【水题】
- POJ1163 The Triangle&&POJ3176 Cow Bowling
- poj1163 dp the triangle
- POJ 1163 The Triangle
- POJ1163 The Triangle dp C语言
- POJ1163 The Triangle 【DP】
- POJ 1163 The Triangle
- POJ 1163 The Triangle
- ACM POJ 1163 The Triangle DP
- poj-3176 Cow Bowling &&poj-1163 The Triangle && hihocoder #1037 : 数字三角形 (基础dp)