commit inicial

Author: MorettiGS

.github/workflows/update_notebook.yml

@@ -0,0 +1,51 @@
+# name: Generate Notebook (PDF) + README.md
+# 
+# on:
+#   push:
+#     branches:
+#       - main
+#     paths:
+#       - 'algorithms/**'
+#       - 'theoretical/**'
+#   pull_request:
+#     branches:
+#       - main
+#     paths:
+#       - 'algorithms/**'
+#       - 'theoretical/**'
+# 
+# jobs:
+#   notebook:
+#     runs-on: ubuntu-latest
+# 
+#     steps:
+#       - name: Checkout code
+#         uses: actions/checkout@v3
+# 
+#       - name: Create Notebook
+#         uses: addnab/docker-run-action@v3
+#         with:
+#             image: mateusvrs/cp-notebook:v1.0
+#             options: -w /usr/src/app -v ${{ github.workspace }}:/usr/src/app
+#             run: make team_name="PrisioneirasWA e WAstros"
+#       
+#       - name: Format Files (Clang) - Auto Commit
+#         uses: stefanzweifel/git-auto-commit-action@v5 
+#         with:
+#           file_pattern: '*.cpp'
+# 
+#           commit_message: "clang(format): cpp files correct indentation"
+#       
+#       - name: Notebook Update - Auto Commit
+#         uses: stefanzweifel/git-auto-commit-action@v5 
+#         with:
+#           file_pattern: 'notebook.pdf'
+# 
+#           commit_message: "notebook(pdf): update to latest version"
+# 
+#       - name: README Update - Auto Commit
+#         uses: stefanzweifel/git-auto-commit-action@v5 
+#         with:
+#           file_pattern: 'README.md'
+# 
+#           commit_message: "docs(readme): update to match with notebook"

.vscode/settings.json

@@ -0,0 +1,7 @@
+{
+    "files.associations": {
+        "iomanip": "cpp",
+        "iostream": "cpp",
+        "ostream": "cpp"
+    }
+}

C++/Algoritmos/README.md

@@ -0,0 +1 @@
+# Algoritmos

C++/Algoritmos/cdq.cpp

@@ -0,0 +1,116 @@
+// LIS 3D problem
+
+struct Segtree{
+    vi t;
+    int n;
+
+    Segtree(int n){
+        this->n = n;
+        t.assign(2*n, 0);
+    }
+
+    int merge(int a, int b){
+        return max(a, b);
+    }
+
+    void build(){
+        for(int i=n-1;i>0;i--)
+            t[i] = merge(t[i<<1], t[i<<1|1]);
+    }
+
+    int query(int l, int r){
+        int resl = -INF, resr = -INF;
+        for(l+=n, r+=n+1; l<r; l>>=1, r>>=1){
+            if(l&1) resl = merge(resl, t[l++]);
+            if(r&1) resr = merge(t[--r], resr);
+        }
+        return merge(resl, resr);
+    }
+
+    void update(int p, int value){
+        p+=n;
+        for(t[p]=max(t[p], value); p >>= 1;)
+            t[p] = merge(t[p<<1], t[p<<1|1]);
+    }
+};
+
+struct point{
+    int x, y, z, id;
+    bool left;
+    point(int x=0, int y=0, int z=0): x(x), y(y), z(z){
+        left = false;
+    }
+    bool operator<(point &o){
+        if(x != o.x) return x < o.x;
+        if(y != o.y) return y > o.y;
+        return z < o.z;
+    }
+};
+
+
+void cdq(int l, int r, vector<point> &a, vi &dp){
+    if(l==r) return;
+
+    int mid = (l+r) / 2;
+
+    cdq(l, mid, a, dp);
+
+    // compress z
+    set<int> uz; map<int, int> idz;
+    for(int i=l;i<=r;i++) uz.insert(a[i].z);
+    int id = 0;
+    for(auto z: uz) idz[z] = id++;
+
+    vector<point> tmp;
+    for(int i=l;i<=r;i++){
+        tmp.pb(a[i]);
+        tmp.back().x = 0;
+        tmp.back().z = idz[tmp.back().z];
+        if(i<=mid)
+            tmp.back().left = true;
+    }
+
+    Segtree st(id);
+
+    sort(tmp.rbegin(), tmp.rend());
+
+    for(auto t: tmp){
+        if(t.left){
+            st.update(t.z, dp[t.id]);
+        }else{
+            dp[t.id] = max(dp[t.id], st.query(0, t.z-1)+1);
+        }
+    }
+
+    cdq(mid+1, r, a, dp);
+}
+
+
+int32_t main()
+{sws;
+
+    int n; cin >> n;
+
+    vector<point> vet(n);
+    for(int i=0;i<n;i++){
+        cin >> vet[i].x >> vet[i].y >> vet[i].z;
+    }
+
+    sort(vet.begin(), vet.end());
+
+    for(int i=0;i<n;i++)
+        vet[i].id = i;
+
+    vi dp(n, 1);
+
+    cdq(0, n-1, vet, dp);
+
+    int ans = 0;
+    for(int i=0;i<n;i++)
+        ans = max(ans, dp[i]);
+
+    cout << ans << endl;
+
+
+    return 0;
+}

C++/Algoritmos/histogram_rectangle.cpp

@@ -0,0 +1,24 @@
+ll bestRectangle(vector<int> hist){
+    int n = hist.size();
+    stack<ll> s;
+    s.push(-1);
+    ll ans = hist[0];
+    vector<ll> left_smaller(n, -1), right_smaller(n, n);
+    for(int i=0;i<n;i++){
+        while(!s.empty() and s.top()!=-1 and hist[s.top()]>hist[i]){
+            right_smaller[s.top()] = i;
+            s.pop();
+        }
+        if(i>0 and hist[i]==hist[i-1])
+            left_smaller[i] = left_smaller[i-1];
+        else
+            left_smaller[i] = s.top();
+        s.push(i);
+    }
+
+    for(int j=0;j<n;j++){
+        ll area = hist[j]*(right_smaller[j]-left_smaller[j]-1);
+        ans = max(ans, area);
+    }
+    return ans;
+}

C++/Algoritmos/meet_in_the_middle.cpp

@@ -0,0 +1,43 @@
+// Subsequence with the biggest sum%m value O(2^(n/2)*n)
+
+int n, m, a[40];
+
+void comb(int l, int r, vi &v){
+    int sz = r-l+1;
+    for(int i=0;i<(1<<sz);i++){
+        int sum = 0;
+        for(int j=0;j<sz;j++)
+            if(i & (1<<j))
+                sum = (sum + a[l+j])%m;
+        v.pb(sum);
+    }
+
+    sort(v.begin(), v.end());
+}
+
+int merge(vi &x, vi &y){
+    int k=y.size()-1, ans=0;
+    for(auto v: x){
+        while(k>0 and v+y[k]>=m)
+            k--;
+        ans = max(ans, v+y[k]);
+    }
+    return ans;
+}
+
+
+int main()
+{sws;
+
+    vi x, y;
+    cin >> n >> m;
+
+    for(int i=0;i<n;i++)
+        cin >> a[i];
+
+    comb(0, n/2, x);
+    comb(n/2 + 1, n-1, y);
+    cout << merge(x, y) << endl;
+
+    return 0;
+}