[Codeforces Round #261 (Div. 2) E]Pashmak and Graph(Dp)

Posted Zars19

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[Codeforces Round #261 (Div. 2) E]Pashmak and Graph(Dp)相关的知识,希望对你有一定的参考价值。

Description

Pashmak‘s homework is a problem about graphs. Although he always tries to do his homework completely, he can‘t solve this problem. As you know, he‘s really weak at graph theory; so try to help him in solving the problem.

You are given a weighted directed graph with n vertices and m edges. You need to find a path (perhaps, non-simple) with maximum number of edges, such that the weights of the edges increase along the path. In other words, each edge of the path must have strictly greater weight than the previous edge in the path.

Help Pashmak, print the number of edges in the required path.

Solution

题意:给出一个无自环、重边的带权有向图,求边权严格递增的最长的路径(可以是非简单路径)

思路题QAQ

O(mlogm)以边权排序后再逐个处理,这样就保证了递增,然后可以O(m)求解,维护每个点作为结尾的最长的边权上升路径的长度

注意边权相等的情况要放在一起处理

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define MAXN 300010
using namespace std;
int n,m,f[MAXN],g[MAXN];
struct Node
{
    int u,v,w;
    bool operator < (const Node& x) const
    {return w<x.w;}
}Edges[MAXN];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(f,0,sizeof(f));
        memset(g,0,sizeof(g));
        for(int i=1;i<=m;i++)
        scanf("%d%d%d",&Edges[i].u,&Edges[i].v,&Edges[i].w);
        int t=1,res=0;
        sort(Edges+1,Edges+1+m);
        for(int i=1;i<=m;i++)
        {
            f[i]=g[Edges[i].u];
            
            if(Edges[i].w!=Edges[i+1].w)
            {
                for(int j=t;j<=i;j++)
                g[Edges[j].v]=max(g[Edges[j].v],f[j]+1),res=max(res,g[Edges[j].v]);
                t=i+1;
            }
        }
        printf("%d\n",res);
    }
    return 0;
} 

 

以上是关于[Codeforces Round #261 (Div. 2) E]Pashmak and Graph(Dp)的主要内容,如果未能解决你的问题,请参考以下文章

Educational Codeforces Round 24 D

Codeforces Round #797 (Div. 3) D, E, F, G题题解

Codeforces Round #402 (Div. 2) D

Codeforces Round #408 (Div. 2) D

Codeforces Round #390 (Div. 2) D

Codeforces 671B/Round #352(div.2) D.Robin Hood 二分