Skip to content

Commit

Permalink
博文raw修复;页面顶栏首页链接提示去除
Browse files Browse the repository at this point in the history
  • Loading branch information
wu-kan committed Feb 24, 2019
1 parent d71f85a commit d5cd14d
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
4 changes: 2 additions & 2 deletions _layouts/page.html
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,7 @@
<h3 class="masthead masthead-title">
<div class="container">
{{ page.title }}
<a href="{{ site.baseurl }}/" title="Home">
<a href="{{ site.baseurl }}/">
<small>{{ site.title }}</small>
</a>
</div>
Expand All @@ -49,7 +49,7 @@ <h3 class="masthead masthead-title">
{{ content }}
</div>
</div>
<label for="sidebar-checkbox" class="sidebar-toggle fa fa-ellipsis-v fa-fw"></label>
<label for="sidebar-checkbox" class="sidebar-toggle fa fa-bars fa-fw"></label>
{% include mermaid.html %}
{% include PrismJS.html %}
{% include katex.html %}
Expand Down
4 changes: 2 additions & 2 deletions _posts/2019-02-16-Bubble Cup 11 - Finals.md
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,6 @@ title: Bubble Cup 11 - Finals
categories: [ACM,题解]
date: 2019-02-16 18:00:00
---
{% raw %}
题不错,以后补…
# [Space Isaac](https://vjudge.net/problem/CodeForces-1045B)
如果一个数不能被表示那么它减去$a_i$仍然在$a$中。
Expand Down Expand Up @@ -64,6 +63,7 @@ int main()
将输入按照r从大到小排序,这样对于排序后的每个机器人,只要它能看到前面的机器,前面的机器一定也可以看到他。

对每个q建立一棵线段树,需要动态建点以节省空间。
{% raw %}
```cpp
#include <bits/stdc++.h>
using namespace std;
Expand Down Expand Up @@ -141,6 +141,7 @@ int main()
printf("%lld", ans);
}
```
{% endraw %}
## 一开始的奇思妙想
把Fenwick建在map上,这样离散化也省了。可惜还是MLE了。
```cpp
Expand Down Expand Up @@ -287,4 +288,3 @@ int main()
printf("%lld", m >> 1);
}
```
{% endraw %}

0 comments on commit d5cd14d

Please sign in to comment.