当前位置:网站首页>POJ 3176-Cow Bowling(DP||记忆化搜索)
POJ 3176-Cow Bowling(DP||记忆化搜索)
2022-07-05 11:22:00 【全栈程序员站长】
Cow Bowling
Time Limit: 1000MS | Memory Limit: 65536K | |
---|---|---|
Total Submissions: 14210 | Accepted: 9432 |
Description
The cows don’t use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Then the other cows traverse the triangle starting from its tip and moving “down” to one of the two diagonally adjacent cows until the “bottom” row is reached. The cow’s score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame.
Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable.
Input
Line 1: A single integer, N
Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle.
Output
Line 1: The largest sum achievable using the traversal rules
Sample Input
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
数字三角形问题。。能够自底向上坐dp dp[i][j]=ma[i][j]+max(dp[i+1][j],dp[i+1][j+1])
巨水 。。想当初半年前自己懵懵懂懂的刷dp啥都不懂。。哎 真是个悲伤的故事。。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cctype>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define ll long long
#define maxn 360
#define pp pair<int,int>
#define INF 0x3f3f3f3f
#define max(x,y) ( ((x) > (y)) ? (x) : (y) )
#define min(x,y) ( ((x) > (y)) ? (y) : (x) )
using namespace std;
int n,dp[maxn][maxn],ma[maxn][maxn];
void solve()
{
for(int i=0;i<n;i++)
dp[n-1][i]=ma[n-1][i];
for(int i=n-2;i>=0;i--)
for(int j=0;j<=i;j++)
dp[i][j]=max(ma[i][j]+dp[i+1][j],ma[i][j]+dp[i+1][j+1]);
printf("%d\n",dp[0][0]);
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)
scanf("%d",&ma[i][j]);
memset(dp,0,sizeof(dp));
solve();
}
return 0;
}
也能够自顶向下记忆化搜索。。然后状态数组含义都差点儿相同 。。个人觉着搜索比較好写。。。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cctype>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define ll long long
#define maxn 360
#define pp pair<int,int>
#define INF 0x3f3f3f3f
#define max(x,y) ( ((x) > (y)) ? (x) : (y) )
#define min(x,y) ( ((x) > (y)) ? (y) : (x) )
using namespace std;
int n,dp[maxn][maxn],ma[maxn][maxn];
int dfs(int x,int y)
{
if(x==n-1)return ma[x][y];
if(dp[x][y]>=0)return dp[x][y];
dp[x][y]=0;
dp[x][y]+=(ma[x][y]+max(dfs(x+1,y),dfs(x+1,y+1)));
return dp[x][y];
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)
scanf("%d",&ma[i][j]);
memset(dp,-1,sizeof(dp));
printf("%d\n",dfs(0,0));
}
return 0;
}
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/109498.html原文链接:https://javaforall.cn
边栏推荐
- go语言学习笔记-初识Go语言
- MFC pet store information management system
- 如何将 DevSecOps 引入企业?
- COMSOL--三维图形的建立
- Array
- Manage multiple instagram accounts and share anti Association tips
- [first release in the whole network] (tips for big tables) sometimes it takes only 1 minute for 2 hours of SQL operation
- Huawei equipment configures channel switching services without interruption
- 不要再说微服务可以解决一切问题了!
- Applet framework taro
猜你喜欢
COMSOL--三维图形的建立
A mining of edu certificate station
[advertising system] incremental training & feature access / feature elimination
[JS] extract the scores in the string, calculate the average score after summarizing, compare with each score, and output
Modulenotfounderror: no module named 'scratch' ultimate solution
AUTOCAD——遮罩命令、如何使用CAD对图纸进行局部放大
[Oracle] use DataGrid to connect to Oracle Database
【爬虫】charles unknown错误
OneForAll安装使用
购买小间距LED显示屏的三个建议
随机推荐
基础篇——基础项目解析
shell脚本文件遍历 str转数组 字符串拼接
uniapp
Zcmu--1390: queue problem (1)
数据库三大范式
Function///
Differences between IPv6 and IPv4 three departments including the office of network information technology promote IPv6 scale deployment
Harbor镜像仓库搭建
Bidirectional RNN and stacked bidirectional RNN
【全网首发】(大表小技巧)有时候 2 小时的 SQL 操作,可能只要 1 分钟
Characteristics and electrical parameters of DDR4
Codeforces Round #804 (Div. 2)
[office] eight usages of if function in Excel
DDoS attack principle, the phenomenon of being attacked by DDoS
Web Security
C language current savings account management system
What about SSL certificate errors? Solutions to common SSL certificate errors in browsers
Lombok makes ⽤ @data and @builder's pit at the same time. Are you hit?
Cron expression (seven subexpressions)
Pytorch training process was interrupted