SW练习_P1434 [SHOI2002]滑雪_拓扑排序

 

人说这题是DFS，不是拓扑啊，我使用拓扑改了改硬是通过了

package com.company.luogu;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;
public class P1434TP {
    static int [] in;
    static int [] out;
    static int [] dis;
    static List<Integer>[] f;// f[i][j] 存放的是i节点的第j个出度
    static List<Integer>[] lists;
    static int C;
    static int R;
    static LinkedList<Integer> list=new LinkedList();//用来存没有入度的点
    public static void main(String[] args) throws Exception{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        R=Integer.parseInt(st.nextToken());//R行
        C=Integer.parseInt(st.nextToken());//C列
        int[][] arr=new int[R][C];
        lists=new List[R*C+1];
        dis=new int[R*C+1];
        in=new int[R*C+1];
        out=new int[R*C+1];
        f=new ArrayList[R*C+1];
        for (int i = 0; i <f.length ; i++) {
            f[i]=new ArrayList<Integer>();
            f[i].add(0);
        }
        for (int i = 0; i <lists.length ; i++) {
            lists[i]=new ArrayList<Integer>();
        }
        for (int i = 0; i <R ; i++) {
            st=new StringTokenizer(reader.readLine());
            for (int j = 0; j <C ; j++) {
                arr[i][j]=Integer.parseInt(st.nextToken());
            }
        }
        processLinkList(arr);
        for (int i = 1; i <=R*C ; i++) {
            if(in[i]==0){//找到入度为0的节点
                list.add(i);
                dis[i]=1;
            }
        }
        while(!list.isEmpty()){
            int c=list.poll();//取出当前节点
            for (int i = 1; i <=out[c] ; i++) {//这个点的连接节点入度-1
                in[f[c].get(i)]--;
                if(in[f[c].get(i)]==0){//如果减完后，这个点入度为0了
                    list.add(f[c].get(i));
                    dis[f[c].get(i)]=dis[c]+1;//子节点的入度=前驱节点的入度+1
                }
            }
        }
        Integer max_lenth=0;
        for (int i = 1; i <=R*C ; i++) {
            if(dis[i]>max_lenth){
                max_lenth=dis[i];
            }
        }
        System.out.println(max_lenth);
        reader.close();
    }
    private static void processLinkList(int[][] arr) {
        for (int i = 0; i <arr.length ; i++) {
            for (int j = 0; j <arr[i].length ; j++) {
                int from=getindex(i,j);
                if(i-1>=0 && arr[i-1][j]<arr[i][j]){//可以滑到上面去
                    int to=getindex(i-1,j);
                    out[from]++;
                    in[to]++;
                    f[from].add(to);
                }
                if(j+1<arr[i].length && arr[i][j+1]<arr[i][j]){//可以滑到右面去
                    int to=getindex(i,j+1);
                    out[from]++;
                    in[to]++;
                    f[from].add(to);
                }
                if(i+1<arr.length && arr[i+1][j]<arr[i][j]){//可以滑到下面去
                    int to=getindex(i+1,j);
                    out[from]++;
                    in[to]++;
                    f[from].add(to);
                }
                if(j-1>=0 && arr[i][j-1]<arr[i][j]){//可以滑到左面去
                    int to=getindex(i,j-1);
                    out[from]++;
                    in[to]++;
                    f[from].add(to);
                }
            }
        }
    }
    public static int getindex(int r,int c){
        return r*C+c+1;
    }
}