1351

Author: Pankajcoder1

Codeforces/After Placement/1840C-Ski Resort.cpp

@@ -0,0 +1,52 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,k,q;
+    cin>>n>>k>>q;
+    vector<long long> v(n);
+    for(int i=0;i<n;i++){
+        cin>>v[i];
+    }
+    long long count=0,maxo=0,ans=0;
+    for(int i=0;i<n;i++){
+        if(max(maxo,v[i])<=q){
+            count++;
+            maxo=max(maxo,v[i]);
+        }
+        else{
+            if(count>=k){
+                long long temp1=count-k+1;
+                long long temp2=(temp1*(temp1+1))/2;
+                ans+=temp2;
+            }
+            count=0,maxo=0;
+            if(v[i]<=q){
+                maxo=v[i];
+                count=1;
+            }
+        }
+    }
+    if(count>=k){
+        long long temp1 = count - k+1;
+        long long temp2 = (temp1 * (temp1 + 1)) / 2;
+        ans += temp2;
+    }
+    cout<<ans<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/1351.Count Negative Numbers in a Sorted Matrix.cpp

@@ -0,0 +1,32 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll;
+const ll INF = 1e18;
+const ll mod1 = 1e9 + 7;
+const ll mod2 = 998244353;
+// Add main code here
+
+class Solution
+{
+public:
+    int countNegatives(vector<vector<int>> &grid)
+    {
+        int cnt = 0;
+        int n = grid.size();
+        int m = grid[0].size();
+        int column = n - 1, row = 0;
+        while (row < m && column >= 0)
+        {
+            if (grid[column][row] < 0)
+            {
+                cnt += (m - row);
+                column--;
+            }
+            else
+                row++;
+        }
+        return cnt;
+    }
+};