codeforces 255C C. Almost Arithmetical Progression(dp)
来源:互联网 发布:java官方下载地址 编辑:程序博客网 时间:2024/06/08 13:34
题目链接:
codeforces 255C
题目大意:
给出一个序列,求最长的子序列,满足隔位的两个数相等,问这个最长的子序列的长度是多少。
题目分析:
- 定义状态dp[i][j]代表以第i个数为末尾,第j个数为倒数第二个的情况下的最长子序列。
- 转移的方法很简单:
dp[i][j]=dp[j][k]+1(a[k]==a[i]) - 其中k的找法很简单,直接在转移的过程中顺便找与a[i]相等的比当前位小的最大的那个。
AC代码:
#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#define MAX 4007using namespace std;int dp[MAX][MAX];int a[MAX],n;int main ( ){ while ( ~scanf ( "%d" , &n ) ) { for ( int i = 1 ;i <= n ; i++ ) scanf ( "%d" , &a[i] ); int ans = 1; for ( int i = 1 ; i <= n ; i++ ) { int k = -1; for ( int j = 1 ; j < i ; j++ ) { if ( k == -1 ) dp[i][j] = 2; else dp[i][j] = dp[j][k] + 1; if ( a[j] == a[i] ) k = j; ans = max ( ans , dp[i][j] ); } } printf ( "%d\n" , ans ); }}
0 0
- CodeForces 255C. Almost Arithmetical Progression (DP)
- Codeforces 255C Almost Arithmetical Progression DP
- codeforces 255C C. Almost Arithmetical Progression(dp)
- codeforces 255C C. Almost Arithmetical Progression(dp)
- codeforces 156C Almost Arithmetical Progression (离散化+dp)
- cf#156-C. Almost Arithmetical Progression-DP
- CF - 255C - Almost Arithmetical Progression(dp)
- CF#255 C. Almost Arithmetical Progression (DP)
- CF 255 C Almost Arithmetical Progression
- C. Almost Arithmetical Progression (cf)
- Codeforces Round #156 (Div. 2) C. Almost Arithmetical Progression
- Codeforces 256A Almost Arithmetical Progression【dp】
- cf 156.div2 C Almost Arithmetical Progression
- CF 156 C Almost Arithmetical Progression
- Almost Arithmetical Progression
- Almost Arithmetical Progression
- Codeforces 567C Geometric Progression (离散 + DP)
- Codeforces Round #Pi (Div. 2) C. Geometric Progression dp
- php 判断字符串中是否包含字符
- 移动广告的转化率怎么算的?
- IOS去掉NavigationBar底部的那条黑线
- 自学QT之static_cast<int>
- 【SDOI2010】【BZOJ1924】所驼门王的宝藏
- codeforces 255C C. Almost Arithmetical Progression(dp)
- 关于Map还有List,然后还是Map,已经晕倒的逻辑。新手照搬。。。。。三个月了,还是新手,真是惭愧。
- WAS 忘记控制台密码
- Unix环境编程学习笔记------在进程间传送文件描述符
- 中级篇——最小生成树
- iOS项目更新之升级Xcode7 & iOS9 & swift2.0
- HDU 3874 Necklace(树状数组离线处理)
- 百度地图
- opencv link libary