Yjmstr的算法竞赛模板（updating）

**YJMSTR 的算法竞赛模板 (Updating)****前言**

作为一个算法竞赛爱好者，写出高效、可维护的代码是非常重要的。以下是 YJMSTR 的算法竞赛模板，包含了常见的数据结构和算法实现。

**模板结构**

markdown# 模板名称##问题描述## 数据范围## 输入输出格式## 提示和约束###代码实现#### [数据结构]

#### [算法]

#### [其他]

cpp#include <iostream>
#include <vector>

using namespace std;

int main() {
 int n;
 cin >> n;
 vector<int> arr(n);
 for (int i =0; i < n; i++) {
 cin >> arr[i];
 }
 // ...
}

cpp#include <iostream>
#include <list>

using namespace std;

struct Node {
 int data;
 Node* next;
};

Node* createList(int n) {
 Node* head = new Node();
 Node* cur = head;
 for (int i =0; i < n; i++) {
 cur->data = i;
 cur->next = new Node();
 cur = cur->next;
 }
 return head;
}

void printList(Node* head) {
 while (head != nullptr) {
 cout << head->data << " ";
 head = head->next;
 }
}

cpp#include <iostream>
#include <stack>

using namespace std;

int main() {
 stack<int> s;
 // ...
}

// 队列实现#include <queue>

int main() {
 queue<int> q;
 // ...
}

cpp#include <iostream>
#include <vector>

using namespace std;

int binarySearch(vector<int>& arr, int target) {
 int left =0;
 int right = arr.size() -1;
 while (left <= right) {
 int mid = left + (right - left) /2;
 if (arr[mid] == target) {
 return mid;
 } else if (arr[mid] < target) {
 left = mid +1;
 } else {
 right = mid -1;
 }
 }
 return -1; // 未找到}

cpp#include <iostream>
#include <vector>

using namespace std;

void dfs(vector<vector<int>>& grid, int x, int y) {
 if (x < 0 || y < 0 || x >= grid.size() || y >= grid[0].size()) return;
 // ...
}

void bfs(vector<vector<int>>& grid, int x, int y) {
 queue<pair<int, int>> q;
 q.push({x, y});
 while (!q.empty()) {
 int curX = q.front().first;
 int curY = q.front().second;
 // ...
 q.pop();
 }
}

cpp#include <iostream>

using namespace std;

int main() {
 int a =5; //101 int b =3; //011 int result = a & b; //001 cout << result << endl;
}

cpp#include <iostream>

using namespace std;

int main() {
 long long n;
 cin >> n;
 long long result = (n * (n +1)) /2;
 cout << result << endl;
}