676 easy

Author: arknave

Diff for: codeforces/676/a.py

@@ -0,0 +1,16 @@
+n = int(input())
+a = list(map(int, input().split()))
+
+x = 0
+y = n - 1
+for i in range(n):
+    if a[i] == 1:
+        x = i
+    if a[i] == n:
+        y = i
+
+old = abs(x - y)
+if n == 2:
+    print(1)
+else:
+    print(max(old, x, n - 1 - x, y, n - 1 - y))

Diff for: codeforces/676/b.py

@@ -0,0 +1,24 @@
+from fractions import Fraction
+
+n, t = map(int, input().split())
+
+tri = []
+for row in range(n):
+    arr = [0] * (row + 1)
+    tri.append(arr)
+
+tri[0][0] = 2048 * t
+
+ans = 0
+for i, row in enumerate(tri):
+    for j, cell in enumerate(row):
+        if cell >= 2048:
+            ans += 1
+            excess = cell - 2048
+            if i + 1 < n:
+                tri[i + 1][j] += excess // 2
+                tri[i + 1][j + 1] += excess // 2
+
+            row[j] = 2048
+
+print(ans)

Diff for: codeforces/676/c.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <cstring>
+#include <algorithm>
+#include <utility>
+#include <vector>
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+
+int n, k;
+string s;
+
+bool works(int size) {
+    //cout << "Trying " << size << '\n';
+    int ac = 0;
+    int bc = 0;
+    for (int i = 0; i < size; ++i) {
+        if (s[i] == 'a') ++ac;
+        else ++bc;
+    }
+    if (ac <= k || bc <= k) {
+        //cout << "First chars match" << '\n';
+        return true;
+    }
+
+
+    for (int i = size; i < n; ++i) {
+        if (s[i - size] == 'a') --ac;
+        else --bc;
+
+        if (s[i] == 'a') ++ac;
+        else ++bc;
+        if (ac <= k || bc <= k) {
+            //cout << "Match at " << i << '\n';
+            return true;
+        }
+    }
+
+    return false;
+}
+
+int main() {
+    cin >> n >> k;
+    cin >> s;
+    if (works(n)) {
+        cout << n << '\n';
+    } else {
+        int lo = 0;
+        int hi = n;
+        while (lo + 1 < hi) {
+            int mid = (lo + hi) / 2;
+            if (works(mid)) {
+                lo = mid;
+            } else {
+                hi = mid;
+            }
+        }
+        cout << lo << '\n';
+    }
+    return 0;
+}