CodeForces 615B Longtail Hedgehog
来源:互联网 发布:win7 64 windows文件夹 编辑:程序博客网 时间:2024/06/05 00:31
题意:给一个图,可以选择几个连续的段,并且编号要递增,然后答案就是这个段的长度*最后一个结点的边数
思路:简单DP,dp[i]=max(dp[i],dp[j]+1)然后跑一遍就好了
#include<bits/stdc++.h>using namespace std;const int maxn = 100005;#define LL long longint dp[maxn];vector<int>e[maxn];int cnt[maxn];int main(){ int n,m;scanf("%d%d",&n,&m);for (int i = 1;i<=m;i++){int u,v;scanf("%d%d",&u,&v);if (u<v)swap(u,v);e[u].push_back(v);cnt[u]++;cnt[v]++;}LL ans = 0;for (int i = 1;i<=n;i++){for (int j = 0;j<e[i].size();j++)dp[i]=max(dp[i],dp[e[i][j]]);dp[i]++;ans = max(ans,1LL*dp[i]*cnt[i]);}printf("%lld\n",ans);}
0 0
- CodeForces 615B Longtail Hedgehog
- codeforces 615B Longtail Hedgehog
- CodeForces 615B Longtail Hedgehog
- codeforces 615B Longtail Hedgehog
- Codeforces 615B Longtail Hedgehog 【dp】
- [CodeForces 615B]Longtail Hedgehog[DP]
- Codeforces 615B Longtail Hedgehog 【dp】
- CodeForces 615 B. Longtail Hedgehog(dp)
- CodeForces 615B Longtail Hedgehog(dp)
- Codeforces 615B Longtail Hedgehog【dp】
- [CodeForces 615B] Longtail Hedgehog [DP]
- CodeForces 615B Longtail Hedgehog 递推
- Codeforces 615B - Longtail Hedgehog(DP)
- 615B Longtail Hedgehog
- Codeforces 615C:Longtail Hedgehog
- Codeforces Round #338 (Div. 2) 615B Longtail Hedgehog(dp)
- Codeforces--615B--Longtail Hedgehog(贪心模拟)
- CF 615B. Longtail Hedgehog 图 dp
- tried to access method android.support.v4.net.ConnectivityManagerCompat.<init>
- win8.1+vs2013环境编译tiff-3.8.2
- Linux信号机制分析和信号处理函数
- EhCache 分布式缓存/缓存集群
- opencv的安装(适用于任何版本的visual studio)
- CodeForces 615B Longtail Hedgehog
- Adobe Photoshop CS6简体中文版下载
- vector 用法
- C++里的模板
- 设计模式-工厂方法模式
- 第八周项目1——(3)数组作数据成员
- 修改image的root password
- 用xml配置连接数据库
- bzoj2243 [SDOI2011]染色 (树链剖分+线段树)