Correcting.

2023206/correct.cpp

@@ -0,0 +1,35 @@
+#include <stdio.h>
+int* stairs = NULL;
+bool* visited = NULL;
+int M, K, H;
+long long total = 0;
+
+int dfs(int start) {
+    if (visited[start]) {
+        return 0;
+    }
+    visited[start] = true;
+    for (int i = 1; start + i < M && i <= K; i++) {
+        if (((stairs[start + i] - stairs[start]) < 0 ? stairs[start] - stairs[start + i] : stairs[start + i] - stairs[start]) <= H) {
+            total++;
+            dfs(start + i);
+        }
+    }
+    return 0;
+}
+
+int main() {
+    scanf("%d %d %d", &M , &K, &H);
+    stairs = new int[M];
+    visited = new bool[M];
+    for (int i = 0; i < M ; i++) {
+        scanf("%d", &stairs[i]);
+    }
+    for (int i = 0; i < M; i++) {
+        if (!visited[i]) {
+            dfs(i);
+        }
+    }
+    printf("%lld", total);
+    return 0;
+}

2023206/main.cpp

@@ -1,6 +1,5 @@
 #include <stdio.h>
-#define TREE_SIZE 10000
-
+#define TREE_SIZE 2000000
 struct TreeNode {
     int val;
     int size;
@@ -11,7 +10,7 @@ struct TreeNode {
 TreeNode tree[TREE_SIZE] = {0};
 int num_in_tree[TREE_SIZE] = {0};
 int num_in_tree_head = 0, num_in_tree_tail = 0;
-int tree_root = 0;
+int tree_root = -1;
 int new_tree_node = 0;
 int M, K, H;
 long long total = 0;
@@ -29,6 +28,13 @@ int dequeue() {
 }
 
 int insert_node(int num, int pos) {
+    if (pos < 0) {
+        // The tree_root is -1!
+        tree[new_tree_node] = TreeNode{num, 1, -1, -1};
+        tree_root = new_tree_node;
+        new_tree_node = (new_tree_node+1) % TREE_SIZE;
+        return 0;
+    }
     tree[pos].size++;
     if (tree[pos].val > num) {
         if (tree[pos].left < 0) {
@@ -108,16 +114,22 @@ int delete_node(int num, int pos) {
 
 int traverse(int pos) {
     // printf("%d %d(", tree[pos].val, tree[pos].size);
-    printf("%d(", tree[pos].val);
-    if (tree[pos].left >= 0) {
-        printf("l%d:", tree[pos].val);
-        traverse(tree[pos].left);
+    // printf("%d(", tree[pos].val);
+    // if (tree[pos].left >= 0) {
+    //     printf("l%d:", tree[pos].val);
+    //     traverse(tree[pos].left);
+    // }
+    // if (tree[pos].right >= 0) {
+    //     printf("r%d:", tree[pos].val);
+    //     traverse(tree[pos].right);
+    // }
+    // printf(")");
+    if (pos < 0) {
+        return 0;
     }
-    if (tree[pos].right >= 0) {
-        printf("r%d:", tree[pos].val);
-        traverse(tree[pos].right);
-    }
-    printf(")");
+    traverse(tree[pos].left);
+    printf("%d", tree[pos].val);
+    traverse(tree[pos].right);
     return 0;
 }
 
@@ -143,45 +155,18 @@ int count_less_than(int target, int pos) {
     }
     return 1 + tree[tree[pos].left].size;
 }
-
-int count_greater_than(int target, int pos) {
-    if (pos == -1) {
-        return 0;
-    }
-
-    if (tree[pos].val > target) {
-        if (tree[pos].right < 0) {
-            return 1 + count_greater_than(target, tree[pos].left);
-        }
-        return tree[tree[pos].right].size + 1 + count_greater_than(target, tree[pos].left);
-    }
-    if (tree[pos].val < target) {
-        return count_greater_than(target, tree[pos].right);
-    }
-
-    // tree[pos].val == target
-
-    if (tree[pos].right < 0) {
-        return 1;
-    }
-    return tree[tree[pos].right].size + 1;
-}
-
 int main() {
     scanf("%d %d %d", &M, &K, &H);
     int num = 0;
-    scanf("%d", &num);
-    tree[tree_root] = TreeNode{num, 1, -1, -1};
-    new_tree_node = 1;
-    enqueue(num);
 
-    for (int i = 1; i < M; i++) {
+    for (int i = 0; i < M; i++) {
         scanf("%d", &num);
-        
+
         // traverse(tree_root);
         // printf("\n");
-        // printf("num: %d, %d %d\n\n", num, count_less_than(num + H, tree_root), count_less_than(num - H - 1, tree_root));
-        total += count_less_than(num + H, tree_root) - count_less_than(num - H - 1, tree_root);
+        // printf("num: %d, %d %d\n\n", num, count_less_than(num + H, tree_root),
+        if(i!=0 ) total += count_less_than(num + H, tree_root);
+        if(i) total -= count_less_than(num - H - 1, tree_root);
         if (i >= K) {
             tree_root = delete_node(dequeue(), tree_root);
         }
@@ -198,6 +183,7 @@ int main() {
     // insert_node(3, tree_root);
     // insert_node(1, tree_root);
     // insert_node(0, tree_root);
+    // tree_root = delete_node(4, tree_root);
     // traverse(tree_root);
     // printf("\n");
     // printf("%d", count_greater_than(1, tree_root));

2023206/rand_input.py

@@ -0,0 +1,12 @@
+import random
+import sys
+M = random.randint(10,1000)
+N = random.randint(10,1000)
+K = random.randint(10,1000)
+arr = list(range(0,M))
+random.shuffle(arr)
+with open('./fuck.txt','w') as f:
+    f.write(str(M)+' '+str(N)+' '+str(K)+'\n')
+    for i in arr:
+        f.write(str(i)+' ')
+    f.write('\n')

2023206/testdata.txt

@@ -5,5 +5,10 @@
 
 ans: 14
 
+9 5 2 -6 -8 -5 -7 -4 -3 -9 -2 -10
+
 15 2 2
-1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
+1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
+
+15 2 2
+15 14 13 12 11 10 9 8 7 6 5 4 3 2 1