#include <iostream>
using namespace std;
const int N = 1000010;
intq[N];
void quick_sort(intq[], int l, int r) {
if (l >= r) return ;
intx = q[(l + r) / 2], i = l - 1, j = r + 1;
while (i < j) {
do i++;while (q[i] < x);
do j--;while (q[j] > x);
if (i < j) swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j + 1, r);
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> q[i];
quick_sort(q, 0, n - 1);
for (int i = 0; i < n; ++i) cout << q[i] << " ";
puts("");
return0;
}
#include <iostream>
using namespace std;
const int N = 100010;
int n, k, q[N];
int quick_sort(int l, int r, int k) {
if (l >= r) returnq[l];
int i = l - 1, j = r + 1, x = q[l + r >> 1];
while (i < j) {
do i ++ ; while (q[i] < x);
do j -- ; while (q[j] > x);
if (i < j) swap(q[i], q[j]);
}
int sl = j - l + 1;
if (k <= sl) return quick_sort(l, j, k);
return quick_sort(j + 1, r, k - sl);
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) scanf("%d", &q[i]);
cout << quick_sort(0, n - 1, k) << endl;
}
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
intq[N], tmp[N], n;
void merge_sort(intq[], int l, int r) {
if (l >= r) return;
int mid = l + r >> 1;
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r) {
if (q[i] < q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while (i <= mid) tmp[k++] = q[i++];
while (j <= r) tmp[k++] = q[j++];
for (int i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
}
int main () {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &q[i]);
merge_sort(q, 0, n - 1);
for (int i = 0; i < n; ++i) printf("%d ", q[i]);
return0;
}
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int a[N], tmp[N];
LL merge_sort(intq[], int l, int r)
{
if (l >= r) return0;
int mid = l + r >> 1;
LL res = merge_sort(q, l, mid) + merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r)
if (q[i] <= q[j]) tmp[k ++ ] = q[i ++ ];
else
{
res += mid - i + 1;
tmp[k ++ ] = q[j ++ ];
}
while (i <= mid) tmp[k ++ ] = q[i ++ ];
while (j <= r) tmp[k ++ ] = q[j ++ ];
for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = tmp[j];
return res;
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
cout << merge_sort(a, 0, n - 1) << endl;
return0;
}
#include <iostream>
using namespace std;
const int N = 100010;
intq[N], m, n;
int main () {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%d", &q[i]);
while (m--) {
intx;
scanf("%d", &x);
int l = 0, r = n - 1;
while (l < r) {
int mid = l + r >> 1;
if (q[mid] >= x) r = mid;
else l = mid + 1;
}
if (q[l] != x) {
cout << "-1 -1" << endl;
} else {
cout << l << " ";
int l = 0, r = n - 1;
while (l < r) {
int mid = l + r + 1 >> 1;
if (q[mid] <= x) l = mid;
else r = mid - 1;
}
cout << l << endl;
}
}
}
#include <iostream>
using namespace std;
const int N = 100010;
int n, m, q[N], s[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> q[i];
s[i] = s[i - 1] + q[i];
}
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
cout << s[b] - s[a - 1] << endl;
}
return0;
}
#include<iostream>usingnamespace std;
int n;
constint N = 100010;
int a[N], s[N];
intmain(){
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
int res = 0;
for (int i = 0, j = 0; i < n; ++i) {
s[a[i]]++;
while (s[a[i]] > 1) {
s[a[j]]--;
j++;
}
res = max(res, i - j + 1);
}
cout << res << endl;
return0;
}
#include<iostream>usingnamespace std;
constint N = 100010;
int n, m, x, a[N], b[N];
intmain(){
cin >> n >> m >> x;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < m; ++i) cin >> b[i];
for (int i = 0, j = m - 1; i < n; ++i) {
while (j >= 0 && a[i] + b[j] > x) j--;
if (j >= 0 && a[i] + b[j] == x) cout << i << " " << j << endl;
}
return0;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· PostgreSQL 和 SQL Server 在统计信息维护中的关键差异
· C++代码改造为UTF-8编码问题的总结
· DeepSeek 解答了困扰我五年的技术问题
· 为什么说在企业级应用开发中,后端往往是效率杀手?
· 用 C# 插值字符串处理器写一个 sscanf
· DeepSeek智能编程
· 精选4款基于.NET开源、功能强大的通讯调试工具
· [翻译] 为什么 Tracebit 用 C# 开发
· 腾讯ima接入deepseek-r1,借用别人脑子用用成真了~
· DeepSeek崛起:程序员“饭碗”被抢,还是职业进化新起点?