HDU 1087 Super Jumping! Jumping! Jumping!(DP)
2014-11-01 04:06
337 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
题目大意:求出上升子序列的最大和
解题思路: 最长上升子序列
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1111;
__int64 dp[maxn];
int num[maxn];
int main ()
{
int n;
while(scanf("%d", &n), n)
{
for(int i = 1; i <= n; i++)
{
scanf("%d", &num[i]);
dp[i] = num[i];
}
for(int i = 1; i <= n; i++)
{
__int64 Max = 0;
for(int j = 1; j < i; j++)
{
if(num[j] < num[i])
Max = max(Max, dp[j]);
}
dp[i] += Max;
}
__int64 ans = 0;
for(int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
printf("%I64d\n", ans);
}
return 0;
}
题目大意:求出上升子序列的最大和
解题思路: 最长上升子序列
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1111;
__int64 dp[maxn];
int num[maxn];
int main ()
{
int n;
while(scanf("%d", &n), n)
{
for(int i = 1; i <= n; i++)
{
scanf("%d", &num[i]);
dp[i] = num[i];
}
for(int i = 1; i <= n; i++)
{
__int64 Max = 0;
for(int j = 1; j < i; j++)
{
if(num[j] < num[i])
Max = max(Max, dp[j]);
}
dp[i] += Max;
}
__int64 ans = 0;
for(int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
printf("%I64d\n", ans);
}
return 0;
}
相关文章推荐
- HDU 1087 Super Jumping! Jumping! Jumping! DP 水题, 没能水过
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087-Super Jumping! Jumping! Jumping!(简单DP)
- [HDU 1087]Super Jumping! Jumping! Jumping!(类LIS DP)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp+最长递增序列)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp)
- hdu 1087 Super Jumping! Jumping! Jumping! (最大 上升子序列 线性 dp)
- HDU - 1087 Super Jumping! Jumping! Jumping!(dp)
- hdu 1087Super Jumping! Jumping! Jumping!(简单的dp就是一个判断条件两个for循环,将这个量与前面出现的两进行比较)
- HDU 1087 Super Jumping! Jumping! Jumping!(最长上升子序列,dp)
- hdu 1087 Super Jumping! Jumping! Jumping!(水DP)
- hdu1087 - Super Jumping! Jumping! Jumping! (dp 求递增子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! (DP)
- Hdu 1087 Super Jumping! Jumping! Jumping! (DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! (dp)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)