diff --git a/dynamic_programming/longest_increasing_subsequence_nlogn.cpp b/dynamic_programming/longest_increasing_subsequence_nlogn.cpp
index 67b3f61ea..b0a49d2da 100644
--- a/dynamic_programming/longest_increasing_subsequence_nlogn.cpp
+++ b/dynamic_programming/longest_increasing_subsequence_nlogn.cpp
@@ -7,7 +7,7 @@
 #include <vector>
 
 using namespace std;
-int LIS(int arr[], int n) {
+int LIS(const std::vector<int>& arr, int n) {
     set<int> active;  // The current built LIS.
     active.insert(arr[0]);
     // Loop through every element.