1R/2016 09 17 - Revision history

Maintenance script: Repair pages found by live-compare batch 0001

2026-03-26T14:46:15Z

Repair pages found by live-compare batch 0001

← Older revision		Revision as of 14:46, 26 March 2026
Line 15:		Line 15:
	#include<cstring>		#include<cstring>
	using namespace std;		using namespace std;
	char f[1010] = {0,}, s[1010] = {0,},ans[1010] = {0,};		char f[1010] = {0,}, s[1010] = {0,},ans[1010] = {0,};
	int len[1010][1010] = { 0, };		int len[1010][1010] = { 0, };

	int main(){		int main(){
Line 25:		Line 25:
	for(int i = 1; i<=x; i++){		for(int i = 1; i<=x; i++){
	for(int j = 1; j<=y; j++){		for(int j = 1; j<=y; j++){
	if(f[i-1] == s[j-1]){		if(f[i-1] == s[j-1]){
	len[i][j] = len[i-1][j-1] + 1;		len[i][j] = len[i-1][j-1] + 1;
	}		}
	else{		else{
	len[i][j] = max(len[i-1][j], len[i][j-1]);		len[i][j] = max(len[i-1][j], len[i][j-1]);
	}		}
	}		}
	}		}
	int num = len[x][y];		int num = len[x][y];
	cout<<num<<endl;		cout<<num<<endl;
	ans[num] = '\0';		ans[num] = '\0';
	num--;		num--;
	int i = x, j = y;		int i = x, j = y;
	while (i >= 1 && j >= 1 && num >= 0) {		while (i >= 1 && j >= 1 && num >= 0) {
	if (f[i-1] == s[j - 1]) {		if (f[i-1] == s[j - 1]) {
	//cout<< ">";		//cout<< ">";
	//cout<< i << " " << j << endl;		//cout<< i << " " << j << endl;
	ans[num] = f[i - 1];		ans[num] = f[i - 1];
	num--;		num--;
	i--;		i--;
Line 49:		Line 49:
	else {		else {
	//cout<< i << " " << j << endl;		//cout<< i << " " << j << endl;
	if (len[i - 1][j] >= len[i][j - 1]) {		if (len[i - 1][j] >= len[i][j - 1]) {
	i--;		i--;
	}		}
Line 66:		Line 66:
	#include <vector>		#include <vector>

	int lcs[1001][1001] = { 0, };		int lcs[1001][1001] = { 0, };
	char len1[1001] = { 0, }, len2[1001] = { 0, };		char len1[1001] = { 0, }, len2[1001] = { 0, };

	int main()		int main()
Line 80:		Line 80:
	for (int j = 1; j <= m; j++)		for (int j = 1; j <= m; j++)
	{		{
	if (len1[i - 1] == len2[j - 1])		if (len1[i - 1] == len2[j - 1])
	lcs[i][j] = lcs[i - 1][j - 1] + 1;		lcs[i][j] = lcs[i - 1][j - 1] + 1;
	else		else
	lcs[i][j] = std::max(lcs[i][j - 1], lcs[i - 1][j]);		lcs[i][j] = std::max(lcs[i][j - 1], lcs[i - 1][j]);
	}		}
	}		}

	//lcs 길이 출력		//lcs 길이 출력
	std::cout << lcs[n][m] << std::endl;		std::cout << lcs[n][m] << std::endl;
	std::vector<char> res;		std::vector<char> res;
	int x = n - 1, y = m - 1;		int x = n - 1, y = m - 1;
Line 95:		Line 95:
	while (x >= 0 && y >= 0)		while (x >= 0 && y >= 0)
	{		{
	if (len1[x] == len2[y]) {		if (len1[x] == len2[y]) {
	res.push_back(len1[x]);		res.push_back(len1[x]);
	x--, y--;		x--, y--;
	}		}
	else lcs[x + 1][y] >= lcs[x][y + 1] ? y-- : x--;		else lcs[x + 1][y] >= lcs[x][y + 1] ? y-- : x--;
	}		}

	//lcs 출력		//lcs 출력
	std::reverse(res.begin(), res.end());		std::reverse(res.begin(), res.end());
	for (int i = 0; i < res.size(); i++) std::cout << res[i];		for (int i = 0; i < res.size(); i++) std::cout << res[i];

	return 0;		return 0;
Line 118:		Line 118:

	== 곽정흠 ==		== 곽정흠 ==

175.124.46.11 at 14:44, 22 September 2016

2016-09-22T14:44:34Z

@@ Line 9: / Line 9: @@
 = 코드 =
 == 15이원준 ==
+ #include&lt;iostream&gt;
 == 박인서 ==
   #include &lt;iostream&gt;

223.62.229.11 at 14:01, 20 September 2016

2016-09-20T14:01:40Z

← Older revision		Revision as of 14:01, 20 September 2016
Line 65:		Line 65:

	== 박인서 ==		== 박인서 ==
	* [https://ko.wikipedia.org/wiki/%EC%B5%9C%EC%9E%A5_%EA%B3%B5%ED%86%B5_%EB%B6%80%EB%B6%84_%EC%88%98%EC%97%B4\|위키피디아 설명]로 대신합니다.		* [https://ko.wikipedia.org/wiki/%EC%B5%9C%EC%9E%A5_%EA%B3%B5%ED%86%B5_%EB%B6%80%EB%B6%84_%EC%88%98%EC%97%B4\|위키피디아 설명]으로 대신합니다.

	== 곽정흠 ==		== 곽정흠 ==

165.194.27.163 at 06:04, 20 September 2016

2016-09-20T06:04:53Z

← Older revision		Revision as of 06:04, 20 September 2016
Line 65:		Line 65:

	== 박인서 ==		== 박인서 ==
	* [https://ko.wikipedia.org/wiki/%EC%B5%9C%EC%9E%A5_%EA%B3%B5%ED%86%B5_%EB%B6%80%EB%B6%84_%EC%88%98%EC%97%B4\|~~위키 페이지~~]로 대신합니다.		* [https://ko.wikipedia.org/wiki/%EC%B5%9C%EC%9E%A5_%EA%B3%B5%ED%86%B5_%EB%B6%80%EB%B6%84_%EC%88%98%EC%97%B4\|위키피디아 설명]로 대신합니다.

	== 곽정흠 ==		== 곽정흠 ==

165.194.27.163 at 06:04, 20 September 2016

2016-09-20T06:04:23Z

@@ Line 11: / Line 11: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 18: / Line 65: @@
 == 박인서 ==
 == 곽정흠 ==

165.194.27.163: {CREATE}

2016-09-20T04:43:01Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/9252|LCS 2]

= 참가자 =
* 박인서

= 코드 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==

= 아이디어 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==