Merge pull request #259 from boostcamp-ai-tech-4/sally

[샐리] 2021.07.26

Author: mergify[bot]

sally/README.md

@@ -133,8 +133,8 @@
 - [X] **17276_배열 돌리기** / [문제](https://www.acmicpc.net/problem/17276) / [풀이]()
 - [X] **20207_달력** / [문제](https://www.acmicpc.net/problem/20207) / [풀이]()
 - [X] **21608_상어 초등학교** / [문제](https://www.acmicpc.net/problem/21608) / [풀이]()
-- [ ] **20164_홀수 홀릭 호석** / [문제](https://www.acmicpc.net/problem/20164) / [풀이]()
-- [ ] **1419_빗물** / [문제](https://www.acmicpc.net/problem/14719) / [풀이]()
+- [X] **20164_홀수 홀릭 호석** / [문제](https://www.acmicpc.net/problem/20164) / [풀이]()
+- [X] **1419_빗물** / [문제](https://www.acmicpc.net/problem/14719) / [풀이]()
 - [ ] **16719_ZOAC** / [문제](https://www.acmicpc.net/problem/16719) / [풀이]()
 
 ---

sally/implementation/14719_빗물.cpp

@@ -0,0 +1,51 @@
+/*
+# Implementation
+# Problem: 14710
+# Memory: 2024KB
+# Time: 0ms
+*/
+#include <iostream>
+#include <vector>
+#include <cmath>
+#include <string>
+#include <string.h>
+using namespace std;
+
+#define MAX 500
+
+int W, H;
+int arr[MAX] = {0,};
+int res[MAX] = {0,};
+
+int main(void) {
+	cin.tie(NULL);
+    ios::sync_with_stdio(false);
+
+	cin>> H >> W;
+	for(int i = 0; i < W; i++)
+		cin >> arr[i];
+
+	for(int i = 0; i < W; i++) // =>
+		for(int j = i+1; j < W; j++)
+			if(arr[i] <= arr[j]){
+				for(int k = i+1; k < j; k++)
+					res[k] = max(res[k], arr[i] - arr[k]);
+				break;
+			}
+	
+
+	for(int i = W; i >= 0; i--) // <=
+		for(int j = i-1; j >=0; j--)
+			if(arr[i] <= arr[j]){
+				for(int k = i-1; k > j; k--)
+					res[k] = max(res[k], arr[i] - arr[k]);
+				break;
+			}
+
+	int result = 0;
+	for(int i = 0; i < W; i++)
+		result+=res[i];
+	cout << result <<'\n';
+
+	return 0;
+}

sally/implementation/20164_홀수 홀릭 호석.cpp

@@ -0,0 +1,77 @@
+/*
+# Implementation
+# Problem: 20164
+# Memory: 2028KB
+# Time: 0ms
+*/
+#include <iostream>
+#include <vector>
+#include <cmath>
+#include <string>
+#include <string.h>
+using namespace std;
+
+string s;
+#define INF 1e9
+int min_val = INF, max_val = 0;
+
+
+// count odd num in str
+int odd_count(string str){
+	int n = 0;
+	int s_size = str.size();
+	for(int i = 0; i < s_size; i++)
+		if(str[i] % 2 == 1)
+			n++;
+	return n;
+}
+
+// update min, max value
+void updater(int num){
+	min_val = min(min_val, num);
+	max_val = max(max_val, num);
+}
+
+// recursively make str
+void func(string str, int cur_odd){
+	/* 1 */
+	cur_odd = cur_odd + odd_count(str+'0');
+
+	int N = str.size();
+	if(N == 1) { /* 2 */
+		updater(cur_odd);
+	}
+	else if(N == 2){ /* 3 */
+		int a = str[0] - '0';
+		int b = str[1] - '0';
+		str = to_string(a+b);
+
+		func(str, cur_odd);
+		
+	}else{ /* 4 */
+		for(int i = 1; i < N-1; i++){
+			for(int j = i+1; j < N; j++){
+				int a = stoi(str.substr(0, i));
+				int b = stoi(str.substr(i, j-i));
+				int c = stoi(str.substr(j, N-j));
+				string tmp_s = to_string(a + b + c);
+
+				func(tmp_s, cur_odd);
+			}
+		}
+	}
+}
+
+int main(void) {
+	cin.tie(NULL);
+    ios::sync_with_stdio(false);
+
+	cin >> s;
+	func(s, 0);
+
+	cout<< min_val << ' ' << max_val << '\n';
+	return 0;
+}
+
+// substr(pos, cnt)
+// [pos, pos + cnt)