competitive-programming-level-up/t.java at main · Erarshad/competitive-programming-level-up · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
import java.util.ArrayList;
import java.util.Scanner;

public class t{
   public static void main(String... args){
      Scanner sc=new Scanner(System.in);
      int n=sc.nextInt();// slots
      int m=sc.nextInt();
      ArrayList<Integer>[]  mat=new ArrayList[n];
      for(int i=0;i<n;i++){
         mat[i]=new ArrayList<>();
      }
     int k=0;
      for(int i=0;i<n;i++){
         k=sc.nextInt();
         for(int j=0;j<k;j++){
            mat[i].add(sc.nextInt());
         }
      }
      //----------------------------------------------

      int max=Integer.MIN_VALUE;

      for(int i=0;i<n;i++){


      }


   }


   private int LIS1_tabu(ArrayList<Integer>arr, int[] dp) {

      int maxLength = 0;
      for (int i = 0; i < arr.size(); i++) {
          int maxLen = 1;
          for (int j = i - 1; j >= 0; j--) {
              if (arr.get(i) > arr[j]) {
                  int len = dp[j];
                  maxLen = Math.max(maxLen, len + 1);
              }
          }
          dp[i] = maxLen;
          maxLength = Math.max(maxLength, maxLen);
      }
      return maxLength;
  }
  private int LDS3_tabu(int[] arr, int[] dp) {

   int maxLength = 0;
   int n = arr.length;
   for (int i = n - 1; i >= 0; i--) {
       int maxLen = 1;
       for (int j = i + 1; j < n; j++) {
           if (arr[i] > arr[j]) {
               int len = dp[j];
               maxLen = Math.max(maxLen, len + 1);
           }
       }
       dp[i] = maxLen;
       maxLength = Math.max(maxLength, maxLen);
   }
   return maxLength;
}
private int LDS2_tabu(int[] arr, int[] dp) {

   int maxLength = 0;
   for (int i = 0; i < arr.length; i++) {
       int maxLen = 1;
       for (int j = i - 1; j >= 0; j--) {
           if (arr[i] < arr[j]) {
               int len = dp[j];
               maxLen = Math.max(maxLen, len + 1);
           }
       }
       dp[i] = maxLen;
       maxLength = Math.max(maxLength, maxLen);
   }
   return maxLength;
}
private int LIS4_tabu(int[] arr, int[] dp) {

   int maxLength = 0;
   int n = arr.length;
   for (int i = n - 1; i >= 0; i--) {
       int maxLen = 1;
       for (int j = i + 1; j < n; j++) {
           if (arr[i] < arr[j]) {
               int len = dp[j];
               maxLen = Math.max(maxLen, len + 1);
           }
       }
       dp[i] = maxLen;
       maxLength = Math.max(maxLength, maxLen);
   }
   return maxLength;
}


}