Add a bunch of other problems.

Some are not finished...

Educational Codeforces Round 32/E. Maximum Subsequence.cpp

@@ -0,0 +1,132 @@
+/* Problem URL: https://codeforces.com/contest/888/problem/E */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n;
+    ll m;
+    cin >> n >> m;
+
+    vl fds(n);
+    repv(i, fds) {
+        cin >> i;
+
+        i %= m;
+    }
+
+    int mid = n / 2;
+
+    vl sumsmid;
+
+    rep(i, (1 << mid)) {
+        ll sum = 0;
+        rep(j, mid) {
+            if ((i >> j) & 1) {
+                sum += fds[j];
+            }
+            
+        }
+
+        sumsmid.push_back(sum % m);
+    }
+
+    vl sums2;
+
+    rep(i, (1 << (n - mid))) {
+        ll sum = 0;
+        rep(j, n - mid) {
+            if ((i >> j) & 1) {
+                sum += fds[j + mid];
+            }
+        }
+
+        sums2.push_back(sum % m);
+    }
+
+    sortv(sumsmid);
+    sortv(sums2);
+
+    ll ans = max(sumsmid.back(), sums2.back());
+
+    repv(i, sumsmid) {
+        auto itr = upper_bound(all(sums2), m - i - 1);
+        if (itr == sums2.begin()) {
+            continue;
+        }
+
+        rmax(ans, (*prev(itr) + i) % m);
+    }
+
+    cout << ans << '\n';
+}