Added STPAR

spoj/README.md

@@ -24,6 +24,7 @@ Name | Status | Tags | Languages
 [PRIME1](PRIME1.py) | :rocket: | `#number-theory` | Python
 [SAMER08F](SAMER08F.cpp) | :heavy_check_mark: | *no tags* | [Python](SAMER08F.py), [C++](SAMER08F.cpp)
 [SEQ](SEQ.cpp) | :heavy_check_mark: | `#transformation-matrix` `#recursive` `#series` | C++
+[STPAR](STPAR.py) | :heavy_check_mark: | `#stack` `#ad-hoc-1` | Python
 [TEST](TEST.py) | :heavy_check_mark: | `#basic` `#tutorial` `#ad-hoc-1` | Python
 [TOANDFRO](TOANDFRO.py) | :heavy_check_mark: | `#ad-hoc-1` | Python
 

spoj/STPAR.py

@@ -0,0 +1,42 @@
+n = int(input())
+
+while(n != 0):
+    arr = [int(i) for i in input().split()]
+    newarr = []
+    stack = []
+    ans = 'yes'
+    i = 0
+
+    while(i < n and len(newarr) == 0):
+        if arr[i] == 1:
+            newarr.append(1)
+        else:
+            stack.append(arr[i])
+        i += 1
+
+    while(i < n):
+        while(len(stack) > 0):
+            if stack[-1] - 1 == newarr[-1]:
+                newarr.append(stack.pop())
+            else:
+                break
+        if arr[i] - 1 == newarr[-1]:
+            newarr.append(arr[i])
+        else:
+            stack.append(arr[i])
+        i += 1
+
+    while(len(stack) > 0):
+        if len(newarr) > 0:
+            if stack[-1] - 1 == newarr[-1]:
+                newarr.append(stack.pop())
+            else:
+                ans = 'no'
+                break
+        else:
+            ans = 'no'
+            break
+
+    print(ans)
+
+    n = int(input())