2017 ACM-ICPC 亚洲区(南宁赛区)网络赛-L. The Heaviest Non-decreasing Subsequence Problem
来源:互联网 发布:php判断水仙花数 编辑:程序博客网 时间:2024/06/06 04:16
DP题,我用<挑战程序设计竞赛>这本书上的最长上升子序列模板(时间复杂度nlogn)的思想做的,具体看代码吧。
代码:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int INF=0x3f3f3f3f;const int maxn=2*1e6+10;const int maxm=3*1e5;int dp[maxn];int val[maxm],ans[maxm]; int main(){ int n; int tot=0; while(scanf("%d",&n)==1) { if(n<0) continue; if(n>=10000) val[tot]=5,ans[tot]=n-10000; else val[tot]=1,ans[tot]=n; tot++; } int len=tot*5+10; fill(dp,dp+len,INF); for(int i=0;i<tot;i++) { int *p; p=upper_bound(dp,dp+len,ans[i]); while(val[i]--) { *p=ans[i]; p++; } } printf("%d\n",lower_bound(dp,dp+len,INF)-dp);}
阅读全文
0 0
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛:The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem (LIS)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛-L. The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛:L. The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L.The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem 最长不下降序列
- The Heaviest Non-decreasing Subsequence Problem 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 常见问题
- 计蒜客 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 The Heaviest Non-decreasing Subsequence Problem
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem(最长不下降子序列变形)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L. The Heaviest Non-decreasing Subsequence Problem(最长非减子序列+思路)
- L. The Heaviest Non-decreasing Subsequence Problem -最长不降子序列变形nlogn-2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 L.The Heaviest Non-decreasing Subsequence Problem 权值最大的最长带权非递减子序列
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛The Heaviest Non-decreasing Subsequence Problem(线段树优化DP)
- SQL RDBMS A Brief Overview of Common Relational Database Management Systems
- cookie和session理解
- redis如何获取有序集合指定范围的个数
- laravel5.4+vue+vux+element的环境搭配
- pytorch扩展
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛-L. The Heaviest Non-decreasing Subsequence Problem
- linux下LAMP环境的搭配
- 虚继承内存布局
- 马拉车算法(Manacher)详解
- JAVA中的缺陷
- C# 代码实现 顺序栈和链栈
- 浅学vue
- socket.io 对话
- 怎样解决word项目编号,第10个编号后的缩进量比前9个大的问题?