Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.InputStreamReader;
- import java.util.StringTokenizer;
- public class SumOfAbsoluteDifferences {
- static int solve(int numbers[], int N, int K) {
- int[][] mat = new int[numbers.length][K];
- int rez = 0;
- for (int i = 1; i < N; i++) {
- for (int j = 1; j < K; j++) {
- for (int p = 0; p < i; p++) {
- int raz = Math.abs(numbers[i] - numbers[p]);
- if (mat[i][j] < mat[p][j-1] + raz)
- mat[i][j] = mat[p][j-1] + raz;
- }
- if (mat[i][j] > rez) rez = mat[i][j];
- }
- }
- return rez;
- }
- public static void main(String[] args) throws Exception {
- int i,j,k;
- BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
- StringTokenizer st = new StringTokenizer(br.readLine());
- int N = Integer.parseInt(st.nextToken());
- int K = Integer.parseInt(st.nextToken());
- int numbers[] = new int[N];
- st = new StringTokenizer(br.readLine());
- for (i=0; i<N; i++) {
- numbers[i] = Integer.parseInt(st.nextToken());
- }
- int res = solve(numbers, N, K);
- System.out.println(res);
- br.close();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment