1.首先找到一段序列的l,r,mid
2.由于递归l~mid,mid+1~r,这两段序列是有序的,我们将二段序列合二为一即可
#include<iostream>
using namespace std;
const int N=1e5+10;
int q[N],tmp[N];
int n;
void merge_sort(int q[],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 i=l,j=mid+1,k=0;
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(i=0;i<k;i++){
q[l++]=tmp[i];
}
}
int main(){
cin >> n;
for(int i=0;i<n;i++) cin>>q[i];
merge_sort(q,0,n-1);
for(int i=0;i<n;i++) cout << q[i] << " ";
return 0;
}
#include<iostream>
#define int long long
using namespace std;
const int N=1e5+10;
int q[N],tmp[N],res;
int n;
void merge_sort(int q[],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 i=l,j=mid+1,k=0;
while(i<=mid&&j<=r){
if(q[i]<=q[j]){
tmp[k++]=q[i++];
}
else {
tmp[k++]=q[j++];
res+=mid-i+1;
}
}
while(i<=mid) {
tmp[k++]=q[i++];
}
while(j<=r) tmp[k++]=q[j++];
for(i=0;i<k;i++){
q[l++]=tmp[i];
}
}
signed main(){
cin >> n;
for(int i=0;i<n;i++) cin>>q[i];
merge_sort(q,0,n-1);
cout << res << endl;
return 0;
}
#include<iostream>
using namespace std;
const int N=1e5+10;
int n,q;
int a[N];
int main(){
cin >> n >> q;
for(int i=0;i<n;i++) cin >> a[i];
while(q--){
int qury;
cin >> qury;
int l=0,r=n-1;
while(l<r){
int mid=l+r>>1;
if(a[mid]<qury){
l=mid+1;
}
else{
r=mid;
}
}
if(a[l]==qury) cout << l << " ";
else if(a[l]!=qury) {
cout <<"-1 -1"<<endl;
continue;
}
l=0,r=n-1;
while(l<r){
int mid=l+r+1>>1;
if(a[mid]<=qury){
l=mid;
}
else {
r=mid-1;
}
}
cout << l << endl;
}
return 0;
}
#include<iostream>
using namespace std;
double n;
int main(){
cin >> n;
double l=-10000,r=10000;
while(r-l>1e-8){
double mid=(l+r)/2;
if(mid*mid*mid<=n){
l=mid;
}
else {
r=mid;
}
}
printf("%.6lf\n",l);
return 0;
}
#include<iostream>
using namespace std;
const int N=100010;
int a[N];
int n;
int main(){
int n,q;
cin >> n >> q;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) a[i]=a[i]+a[i-1];
while(q--){
int l,r;
cin >> l >> r;
cout << a[r]-a[l-1] << endl;
}
return 0;
}
#include<iostream>
using namespace std;
const int N=1010;
int n,m,q;
int a[N][N];
int sum[N][N];
int main(){
cin >> n >> m >> q;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin >> a[i][j];
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+a[i][j];
}
}
while(q--){
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << sum[x2][y2]-sum[x2][y1-1]-sum[x1-1][y2]+sum[x1-1][y1-1] << endl;
}
return 0;
}
#include<iostream>
using namespace std;
const int N=1e5+10;
int n,m;
int a[N],s[N];
int main(){
cin >> n >> m;
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=1;i<=n;i++) s[i]=a[i]-a[i-1];
while(m--){
int l,r,c;
cin >> l >> r >> c;
s[r+1]-=c;
s[l]+=c;
}
int sum=0;
for(int i=1;i<=n;i++){
sum+=s[i];
cout << sum << " ";
}
return 0;
}
#include<iostream>
using namespace std;
const int N=1010;
int a[N][N],s[N][N],b[N][N];
int n,m,q;
void insert(int x1,int y1,int x2,int y2,int c){
s[x1][y1]+=c;
s[x2+1][y2+1]+=c;
s[x1][y2+1]-=c;
s[x2+1][y1]-=c;
}
int main(){
cin >> n >> m >> q;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin >> a[i][j];
insert(i,j,i,j,a[i][j]);
}
}
while(q--){
int x1,y1,x2,y2,c;
cin >> x1 >> y1 >> x2 >> y2 >> c;
insert(x1,y1,x2,y2,c);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
b[i][j]=b[i-1][j]+b[i][j-1]+s[i][j]-b[i-1][j-1];
cout << b[i][j] << " ";
}
cout << endl;
}
return 0;
}