add _static
This commit is contained in:
181
storage/zeta/_static/14315.html
Normal file
181
storage/zeta/_static/14315.html
Normal file
@@ -0,0 +1,181 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="ko">
|
||||
<head>
|
||||
<meta charset="UTF-8" />
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
|
||||
<title>BOJ 14315 - Offline</title>
|
||||
<style>
|
||||
:root {
|
||||
--bg: #fafaf8;
|
||||
--paper: #ffffff;
|
||||
--ink: #1e1f24;
|
||||
--muted: #6a6d75;
|
||||
--line: #d8dce3;
|
||||
--accent: #0d6e6e;
|
||||
--code-bg: #f4f6fb;
|
||||
}
|
||||
* { box-sizing: border-box; }
|
||||
body {
|
||||
margin: 0;
|
||||
background:
|
||||
radial-gradient(circle at 15% 0%, #f0efe9 0%, transparent 42%),
|
||||
radial-gradient(circle at 85% 20%, #e7f1f2 0%, transparent 38%),
|
||||
var(--bg);
|
||||
color: var(--ink);
|
||||
font-family: "Noto Sans KR", "Pretendard", "Apple SD Gothic Neo", sans-serif;
|
||||
line-height: 1.65;
|
||||
}
|
||||
main {
|
||||
max-width: 980px;
|
||||
margin: 0 auto;
|
||||
padding: 24px 16px 56px;
|
||||
}
|
||||
.header {
|
||||
background: var(--paper);
|
||||
border: 1px solid var(--line);
|
||||
border-radius: 14px;
|
||||
padding: 18px 20px;
|
||||
margin-bottom: 18px;
|
||||
}
|
||||
.header h1 { margin: 0 0 6px; font-size: 1.5rem; }
|
||||
.header p { margin: 0; color: var(--muted); font-size: 0.95rem; }
|
||||
.header a { color: var(--accent); text-decoration: none; }
|
||||
.section {
|
||||
background: var(--paper);
|
||||
border: 1px solid var(--line);
|
||||
border-radius: 14px;
|
||||
padding: 16px 18px;
|
||||
margin-bottom: 14px;
|
||||
overflow-x: auto;
|
||||
}
|
||||
h2 {
|
||||
margin: 0 0 10px;
|
||||
font-size: 1.05rem;
|
||||
color: var(--accent);
|
||||
border-bottom: 1px solid var(--line);
|
||||
padding-bottom: 8px;
|
||||
}
|
||||
pre, code {
|
||||
font-family: "JetBrains Mono", "Fira Code", monospace;
|
||||
background: var(--code-bg);
|
||||
}
|
||||
pre {
|
||||
padding: 12px;
|
||||
border-radius: 10px;
|
||||
border: 1px solid #e7ebf2;
|
||||
overflow: auto;
|
||||
}
|
||||
blockquote {
|
||||
margin: 14px 0;
|
||||
padding: 16px 16px 14px 22px;
|
||||
border-left: 4px solid var(--accent);
|
||||
border-radius: 10px;
|
||||
background: linear-gradient(90deg, #eef8f8 0%, #f9fdfd 100%);
|
||||
color: #24313a;
|
||||
font-weight: 600;
|
||||
position: relative;
|
||||
}
|
||||
blockquote::before {
|
||||
content: "“";
|
||||
position: absolute;
|
||||
left: 8px;
|
||||
top: 2px;
|
||||
font-size: 1.35rem;
|
||||
line-height: 1;
|
||||
color: #0b5f5f;
|
||||
opacity: 0.7;
|
||||
}
|
||||
blockquote > :first-child { margin-top: 0; }
|
||||
blockquote > :last-child { margin-bottom: 0; }
|
||||
q {
|
||||
color: #114f50;
|
||||
font-weight: 700;
|
||||
background: #edf8f8;
|
||||
border-radius: 6px;
|
||||
padding: 0 4px;
|
||||
}
|
||||
.math-inline math {
|
||||
font-size: 1em;
|
||||
vertical-align: middle;
|
||||
}
|
||||
.math-block {
|
||||
margin: 10px 0;
|
||||
padding: 8px 10px;
|
||||
overflow-x: auto;
|
||||
background: #f8fbff;
|
||||
border: 1px solid #e2ecf8;
|
||||
border-radius: 8px;
|
||||
}
|
||||
.math-block math {
|
||||
font-size: 1.04em;
|
||||
display: block;
|
||||
}
|
||||
table { border-collapse: collapse; width: 100%; }
|
||||
th, td { border: 1px solid var(--line); padding: 6px 8px; }
|
||||
img { max-width: 100%; height: auto; }
|
||||
</style>
|
||||
</head>
|
||||
<body>
|
||||
<main>
|
||||
<header class="header">
|
||||
<h1>Sherlock and Parentheses (Large)</h1>
|
||||
</header>
|
||||
<article class="section">
|
||||
<h2>문제</h2>
|
||||
<p>Sherlock and Watson have recently enrolled in a computer programming course. Today, the tutor taught them about the balanced parentheses problem. A string <code>S</code> consisting only of characters <code>(</code> and/or <code>)</code> is balanced if:</p>
|
||||
|
||||
<ul>
|
||||
<li>It is the empty string, or:</li>
|
||||
<li>It has the form <code>(</code>S<code>)</code>, where S is a balanced string, or:</li>
|
||||
<li>It has the form S<sub>1</sub>S<sub>2</sub>, where S<sub>1</sub> is a balanced string and S<sub>2</sub> is a balanced string.</li>
|
||||
</ul>
|
||||
|
||||
<p>Sherlock coded up the solution very quickly and started bragging about how good he is, so Watson gave him a problem to test his knowledge. He asked Sherlock to generate a string S of L + R characters, in which there are a total of L left parentheses <code>(</code> and a total of R right parentheses <code>)</code>. Moreover, the string must have as many different balanced non-empty substrings as possible. (Two substrings are considered different as long as they start or end at different indexes of the string, even if their content happens to be the same). Note that S itself does not have to be balanced.</p>
|
||||
|
||||
<p>Sherlock is sure that once he knows the maximum possible number of balanced non-empty substrings, he will be able to solve the problem. Can you help him find that maximum number?</p>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>입력</h2>
|
||||
<p>The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of one line with two integers: L and R.</p>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>출력</h2>
|
||||
<p>For each test case, output one line containing <code>Case #x: y</code>, where <code>x</code> is the test case number (starting from 1) and <code>y</code> is the answer, as described above.</p>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>제한</h2>
|
||||
<ul>
|
||||
<li>1 ≤ T ≤ 100.</li>
|
||||
<li>0 ≤ L ≤ 10<sup>5</sup>.</li>
|
||||
<li>0 ≤ R ≤ 10<sup>5</sup>.</li>
|
||||
<li>1 ≤ L + R ≤ 10<sup>5</sup>.</li>
|
||||
</ul>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>힌트</h2>
|
||||
<p>In Case 1, the only possible string is <code>(</code>. There are no balanced non-empty substrings.</p>
|
||||
|
||||
<p>In Case 2, the optimal string is <code>()</code>. There is only one balanced non-empty substring: the entire string itself.</p>
|
||||
|
||||
<p>In Case 3, both strings <code>()()(</code> and <code>(()()</code> give the same optimal answer.</p>
|
||||
|
||||
<p>For the case <code>()()(</code>, for example, the three balanced substrings are <code>()</code> from indexes 1 to 2, <code>()</code> from indexes 3 to 4, and <code>()()</code> from indexes 1 to 4.</p>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>예제 입력 1 복사</h2>
|
||||
<pre class="sampledata" id="sample-input-1">3
|
||||
1 0
|
||||
1 1
|
||||
3 2
|
||||
</pre>
|
||||
</article>
|
||||
<article class="section">
|
||||
<h2>예제 출력 1 복사</h2>
|
||||
<pre class="sampledata" id="sample-output-1">Case #1: 0
|
||||
Case #2: 1
|
||||
Case #3: 3
|
||||
</pre>
|
||||
</article>
|
||||
</main>
|
||||
</body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user