<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>信息学基地社区 - OJ题解</title>
    <link>https://bbs.singera.cn/forum.php?mod=forumdisplay&amp;fid=94</link>
    <description>Latest 20 threads of OJ题解</description>
    <copyright>Copyright(C) 信息学基地社区</copyright>
    <generator>Discuz! Board by Comsenz Inc.</generator>
    <lastBuildDate>Fri, 12 Jun 2026 21:45:51 +0000</lastBuildDate>
    <ttl>60</ttl>
    <image>
      <url>https://bbs.singera.cn/static/image/common/logo_88_31.gif</url>
      <title>信息学基地社区</title>
      <link>https://bbs.singera.cn/</link>
    </image>
    <item>
      <title>1785(x)</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=603</link>
      <description><![CDATA[#include
using namespace std;
#define MAX_N 9999
#define MAX_NAME 10
struct task{
    char name[MAX_N+1];
    int time;
};
task t[MAX_N+1];
int front=0;
int rear=0;
int initqueue(){
    front=rear=0;
    return 0;
}
bool isfull(){
    retu]]></description>
      <category>OJ题解</category>
      <author>程子</author>
      <pubDate>Sat, 10 May 2025 06:11:28 +0000</pubDate>
    </item>
    <item>
      <title>发v根本</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=556</link>
      <description><![CDATA[3efvbgdm,lknhuy765 tyn nhjyu67]]></description>
      <category>OJ题解</category>
      <author>Tommy</author>
      <pubDate>Mon, 03 Mar 2025 11:06:41 +0000</pubDate>
    </item>
    <item>
      <title>1000题解</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=514</link>
      <description><![CDATA[#include ]]></description>
      <category>OJ题解</category>
      <author>小张</author>
<enclosure url="/forum/
{" length="
" type="image/jpeg" />      <pubDate>Sat, 18 Jan 2025 09:50:22 +0000</pubDate>
    </item>
    <item>
      <title>1000题解？？？？？</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=505</link>
      <description><![CDATA[包对的好吧（bushi）

#include 
using namespace std;
int t; //计数变量 
void printSum(int a, int b) {
    if (t == 0) {
        cout  a &gt;&gt; b;
    printSum(a, b);//调用递归函数 
    return 0;
}]]></description>
      <category>OJ题解</category>
      <author>WYT</author>
      <pubDate>Fri, 17 Jan 2025 10:35:37 +0000</pubDate>
    </item>
    <item>
      <title>求助-24周周赛第五题</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=436</link>
      <description><![CDATA[B-358-E 24周周赛第五题，求助！
请问这道题到底什么解法？？？？]]></description>
      <category>OJ题解</category>
      <author>Jason1129</author>
      <pubDate>Thu, 29 Aug 2024 03:19:55 +0000</pubDate>
    </item>
    <item>
      <title>大杂烩优化，再也不愁运行错误</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=422</link>
      <description><![CDATA[c++的O3优化：#pragma GCC optimize(3,\&quot;Ofast\&quot;,\&quot;inline\&quot;)   注：加在头文件前面。c++的输入优化：std::ios::sync_with_stdio(false);   cin.tie(0);   cout.tie(0);  注：加在int main下面。
c++的O2优化： #pragma GCC optimize(2)   注：加在头文件前面。
ok 成功学废 ...]]></description>
      <category>OJ题解</category>
      <author>Homme</author>
      <pubDate>Mon, 05 Aug 2024 03:19:31 +0000</pubDate>
    </item>
    <item>
      <title>谁会3247！</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=412</link>
      <description><![CDATA[谁会3247！！！
真的太难了]]></description>
      <category>OJ题解</category>
      <author>o0iver</author>
      <pubDate>Thu, 09 May 2024 12:57:43 +0000</pubDate>
    </item>
    <item>
      <title>差分是个什么东东？</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=407</link>
      <description><![CDATA[先做个自我介绍
大家好我是o0iver
那直接进入正题：差分是个什么 东东？？


那我们就需要先了解一下他的兄弟：前缀和

1.前缀和
    前缀和通俗的定义就是一个数组前n项的和
     就是sum[1]=a[1],sum[2]=a[1]+a[2],sum[3]=a[1]+a[2]+a[3]......
    举个例子：


     ...]]></description>
      <category>OJ题解</category>
      <author>o0iver</author>
      <pubDate>Wed, 17 Apr 2024 13:09:00 +0000</pubDate>
    </item>
    <item>
      <title>取消验证码！！（同意的人回复个1)  取消验证码！！（同...</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=389</link>
      <description><![CDATA[取消验证码！！（同意的人回复个1) 取消验证码！！（同意的人回复个1)
 取消验证码！！（同意的人回复个1)
 取消验证码！！（同意的人回复个1)
 取消验证码！！（同意的人回复个1)
 取消验证码！！（同意的人回复个1)
 取消验证码！！（同意的人回复个1) 取消验证码！ ...]]></description>
      <category>OJ题解</category>
      <author>清泉石上流</author>
      <pubDate>Sun, 12 Nov 2023 08:36:37 +0000</pubDate>
    </item>
    <item>
      <title>谁会3800和3801</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=379</link>
      <description><![CDATA[谁会3800和3801，在线等，挺急的！！！]]></description>
      <category>OJ题解</category>
      <author>liushupeng</author>
      <pubDate>Tue, 22 Aug 2023 11:06:49 +0000</pubDate>
    </item>
    <item>
      <title>3390</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=369</link>
      <description><![CDATA[#include 
#define MAXN 200100
using namespace std;
int n, a[MAXN], l[MAXN], r[MAXN];
vector b;
int main() {
    scanf(\&quot;%d\&quot;, &amp;n);
    a[0] = a[n + 1] = -1, r[0] = 1, l[n + 1] = n;
    for (int i = 1; i]]></description>
      <category>OJ题解</category>
      <author>William</author>
      <pubDate>Mon, 17 Jul 2023 07:40:11 +0000</pubDate>
    </item>
    <item>
      <title>123456</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=368</link>
      <description><![CDATA[#include
using namespace std;
#define N 110
struct pos{
]]></description>
      <category>OJ题解</category>
      <author>李良泽</author>
<enclosure url="/forum/if(maze[xx][yy]==0) {
" length="" type="image/jpeg" />      <pubDate>Sat, 03 Jun 2023 07:47:06 +0000</pubDate>
    </item>
    <item>
      <title>1245小奇の迷宫捏</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=367</link>
      <description><![CDATA[#include
using namespace std;
int n;
int ha,la,hb,lb;
char ch[110][110];
bool vis[110][110];
int dr[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
struct pos{
]]></description>
      <category>OJ题解</category>
      <author>李良泽</author>
<enclosure url="/forum/int y;
" length="int step;
};
bool f=false;
void bfs(){
" type="image/jpeg" />      <pubDate>Sat, 27 May 2023 07:41:40 +0000</pubDate>
    </item>
    <item>
      <title>最爱用哪个C++软件？</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=361</link>
      <description><![CDATA[]]></description>
      <category>OJ题解</category>
      <author>William</author>
      <pubDate>Sat, 22 Apr 2023 06:14:55 +0000</pubDate>
    </item>
    <item>
      <title>1352</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=360</link>
      <description><![CDATA[#include
using namespace std;
const int N=260;
int n;
string str;
stack s;
int b[N];
int main()
{
]]></description>
      <category>OJ题解</category>
      <author>William</author>
      <pubDate>Sat, 22 Apr 2023 06:11:19 +0000</pubDate>
    </item>
    <item>
      <title>1351</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=359</link>
      <description><![CDATA[#include
#include
using namespace std;
stack ts;
int main(){
    string s;
    cin&gt;&gt;s;
    for(int i=0;i]]></description>
      <category>OJ题解</category>
      <author>William</author>
      <pubDate>Sat, 22 Apr 2023 06:10:11 +0000</pubDate>
    </item>
    <item>
      <title>1231</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=358</link>
      <description><![CDATA[#include
#include
using namespace std;
stacksk;
char ep[101];
int main(){
    string str;//接收字符串
    while(cin&gt;&gt;str) //输入
    {
         cout]]></description>
      <category>OJ题解</category>
      <author>William</author>
      <pubDate>Sat, 22 Apr 2023 06:09:40 +0000</pubDate>
    </item>
    <item>
      <title>1375 猴子偷桃（1440）</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=350</link>
      <description><![CDATA[题目传送门

题目大意：
用一堆桃子和另一堆桃子合并，用合并的桃子再用另一堆桃子合并，直到只剩一堆桃子


明显的，体力等于两堆桃子之和，所以我们经过简单的推理得到
优先合并桃子少的，体力之和最少。

有了策略，我们就可以开始写代码了。
打住！！
n是30000，你 ...]]></description>
      <category>OJ题解</category>
      <author>Jason1129</author>
      <pubDate>Sun, 09 Apr 2023 00:56:11 +0000</pubDate>
    </item>
    <item>
      <title>1806</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=349</link>
      <description><![CDATA[#include
using  namespace std;
int arr[1000000];
void maxhead(int arr[], int size, int i) {
    int l =  i * 2;
    int r = i * 2 + 1;
    int  x = i;
    if (l  arr[x]) {
        x = l;
    }
    if (r  arr[x]) {
        x = r;
    }
    if]]></description>
      <category>OJ题解</category>
      <author>yuanbao</author>
      <pubDate>Sun, 09 Apr 2023 00:54:30 +0000</pubDate>
    </item>
    <item>
      <title>1370 二叉树遍历</title>
      <link>https://bbs.singera.cn/forum.php?mod=viewthread&amp;tid=348</link>
      <description><![CDATA[#include
#include
using namespace std;
string z,c;
void x(int zf,int zt,int cf,int ct){
    bool b = 0;
    int root;
    for(int i = cf;ic;
    x(0,z.size()-1,0,c.size()-1);
    return 0;
}]]></description>
      <category>OJ题解</category>
      <author>yuanbao</author>
      <pubDate>Sun, 09 Apr 2023 00:43:44 +0000</pubDate>
    </item>
  </channel>
</rss>