From 7f74d8c55e6813f26dfa7c2ef1bcb3aefa8f1f63 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Fri, 8 Sep 2023 23:01:30 +0300 Subject: Solve problem Fence on codeforces --- codeforces/Fence/main.cpp | 150 ++++++++++++++++++++++++++++++++++++++ codeforces/Fence/main_input0.txt | 2 + codeforces/Fence/main_input1.txt | 2 + codeforces/Fence/main_input2.txt | 2 + codeforces/Fence/main_output0.txt | 1 + codeforces/Fence/main_output1.txt | 1 + codeforces/Fence/main_output2.txt | 1 + 7 files changed, 159 insertions(+) create mode 100755 codeforces/Fence/main.cpp create mode 100644 codeforces/Fence/main_input0.txt create mode 100644 codeforces/Fence/main_input1.txt create mode 100644 codeforces/Fence/main_input2.txt create mode 100644 codeforces/Fence/main_output0.txt create mode 100644 codeforces/Fence/main_output1.txt create mode 100644 codeforces/Fence/main_output2.txt (limited to 'codeforces') diff --git a/codeforces/Fence/main.cpp b/codeforces/Fence/main.cpp new file mode 100755 index 0000000..bc828e0 --- /dev/null +++ b/codeforces/Fence/main.cpp @@ -0,0 +1,150 @@ +#include +#include +using namespace std; + +using ll = long long; +using pii = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound +#define make_unique(x) \ + sort(all((x))); \ + (x).resize(unique(all((x))) - (x).begin()) +#define ceil(a, b) ((a) + (b)-1) / (b) + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +template +ostream &operator<<(ostream &os, const pair &p); +template ostream &operator<<(ostream &os, const vector &vec); +template +ostream &operator<<(ostream &os, const map &m); +template +ostream &operator<<(ostream &os, const unordered_map &m); +template ostream &operator<<(ostream &os, const set &s); +template +ostream &operator<<(ostream &os, const unordered_set &s); + +template +ostream &operator<<(ostream &os, const pair &p) { + os << "(" << p.first << ", " << p.second << ")"; + return os; +} + +template ostream &operator<<(ostream &os, const vector &vec) { + os << "{"; + for (size_t i = 0; i < vec.size(); ++i) { + if (i > 0) + os << ", "; + os << vec[i]; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_map &m) { + os << "{"; + for (const auto &p : m) { + os << p.first << ": " << p.second << ", "; + } + os << "}"; + return os; +} + +template ostream &operator<<(ostream &os, const set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +template +ostream &operator<<(ostream &os, const unordered_set &s) { + int i = 0; + os << "{"; + for (const auto &e : s) { + if (i > 0) + os << ", "; + os << e; + i++; + } + os << "}"; + return os; +} + +void dbg() { cerr << "\n"; } + +template void dbg(T val, TS... vals) { + cerr << val << " "; + dbg(vals...); +} + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +// 1 2 3 4 5 +// 3 2 6 5 4 + +void solve() { + int n, k; + cin >> n >> k; + vi v(n); + for (auto &x : v) { + cin >> x; + } + ll ans = 0; + for (int i = 0; i < k; i++) { + ans += v[i]; + } + int idx = 1; + ll mn = ans; + for (int i = 0; i < n - k; i++) { + if (mn > ans + v[i + k] - v[i]) { + idx = i + 2; + } + ans += v[i + k] - v[i]; + mn = min(mn, ans); + } + cout << idx << '\n'; +} + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + solve(); +} diff --git a/codeforces/Fence/main_input0.txt b/codeforces/Fence/main_input0.txt new file mode 100644 index 0000000..6e3da58 --- /dev/null +++ b/codeforces/Fence/main_input0.txt @@ -0,0 +1,2 @@ +7 3 +1 2 6 1 1 7 1 diff --git a/codeforces/Fence/main_input1.txt b/codeforces/Fence/main_input1.txt new file mode 100644 index 0000000..fa92449 --- /dev/null +++ b/codeforces/Fence/main_input1.txt @@ -0,0 +1,2 @@ +10 5 +1 2 3 1 2 2 3 1 4 5 \ No newline at end of file diff --git a/codeforces/Fence/main_input2.txt b/codeforces/Fence/main_input2.txt new file mode 100644 index 0000000..3fb68bb --- /dev/null +++ b/codeforces/Fence/main_input2.txt @@ -0,0 +1,2 @@ +2 1 +20 1 \ No newline at end of file diff --git a/codeforces/Fence/main_output0.txt b/codeforces/Fence/main_output0.txt new file mode 100644 index 0000000..00750ed --- /dev/null +++ b/codeforces/Fence/main_output0.txt @@ -0,0 +1 @@ +3 diff --git a/codeforces/Fence/main_output1.txt b/codeforces/Fence/main_output1.txt new file mode 100644 index 0000000..56a6051 --- /dev/null +++ b/codeforces/Fence/main_output1.txt @@ -0,0 +1 @@ +1 \ No newline at end of file diff --git a/codeforces/Fence/main_output2.txt b/codeforces/Fence/main_output2.txt new file mode 100644 index 0000000..d8263ee --- /dev/null +++ b/codeforces/Fence/main_output2.txt @@ -0,0 +1 @@ +2 \ No newline at end of file -- cgit v1.2.3