Add workflow test

Author: samuraiexx

.github/workflows/icpc-reference-tester.yml

@@ -3,21 +3,16 @@ on: [pull_request]
 jobs:
   check-tests:
     runs-on: ubuntu-latest
-    defaults:
-      run:
-        shell: bash
-        working-directory: icpc-reference-tester 
     steps:
       - uses: actions/checkout@v2
+      - run: git clone https://github.com/samuraiexx/icpc-reference-tester
       - uses: nanasess/setup-chromedriver@master
       - uses: actions-rs/toolchain@v1
         with:
           toolchain: stable
-      - uses: actions-rs/cargo@v1
-        with:
-          command: build
-          args: --release
-      - uses: actions-rs/cargo@v1
-        with:
-          command: run 
-          args: --release test/test_folder
+      - run: cargo build --release
+        working-directory: icpc-reference-tester 
+      - run: icpc-reference-tester/target/release/icpc-reference-tester tests
+        env:
+          CF_USER: ${{ secrets.CF_USER }}
+          CF_PASSWORD: ${{ secrets.CF_PASSWORD }}

dynamic-programming/lis.cpp

@@ -3,13 +3,13 @@
 // dp(i) = max j<i { dp(j) | a[j] < a[i] } + 1
 //
 
-int dp[N], v[N], n, lis;
+// int dp[N], v[N], n, lis;
 
 memset(dp, 63, sizeof dp);
-for (int i=0; i<n; ++i) {
+for (int i = 0; i < n; ++i) {
   // increasing: lower_bound
   // non-decreasing: upper_bound
-  int j = lower_bound(dp, dp+lis, v[i]) - dp;
+  int j = lower_bound(dp, dp + lis, v[i]) - dp;
   dp[j] = min(dp[j], v[i]);
-  lis = max(lis, j+1);
+  lis = max(lis, j + 1);
 }

icpc-reference-tester

@@ -0,0 +1,17 @@
+// @problem_url: https://codeforces.com/problemset/problem/340/D
+#include<bits/stdc++.h>
+using namespace std;
+
+const int N = 2e5;
+
+int main() {
+  int dp[N], v[N], n, lis;
+
+  cin >> n;
+  for (int i = 0; i < n; i++)
+    cin >> v[i];
+
+  // @include: dynamic-programming/lis.cpp
+
+  cout << lis << endl;
+}