【模板】基础算法&&小算法

逆序对：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 200005;
int n,num[maxn],a[maxn],sum[maxn],m;
long long ans = 0;
char ss[233];
void msort(int l,int r)
{
    if(l == r) return;
    int mid = (l + r) >> 1;
    msort(l,mid);
    msort(mid + 1,r); 
    int ll = l,rr = mid + 1,now = 1;
    while(ll <= mid && rr <= n)
    {
        if(num[ll] > num[rr])
        {
            a[now] = num[rr];
            now ++;rr ++;
            ans += mid - ll + 1;
        }
        else
        {
            a[now] = num[ll];
            now ++,ll ++;
        }
    }
    while(ll <= mid)
    {
        a[now] = num[ll];
        ll ++;now ++;
    }
    while(rr <= n)
    {
        a[now] = num[rr];
        rr ++;now ++;
    }
    int tot = r - l + 1;
    for(int i = 1; i <= tot; i ++)
        num[l - 1 + i] = a[i];
    return;
}

int main()
{
    memset(num,0,sizeof(num));
    memset(a,0,sizeof(a));
    scanf("%d",&n);
    for(int i = 1; i <= n; i ++)
    scanf("%d",&num[i]);
    msort(1,n);
    printf("%lld\n",ans);
    return 0;
}

尺取法：

void cqf()
{
     int sum = 0,s = 1,e = 1;  
        int ans = n + 1;  
        for(;;)  
        {  
            while(e <= n && sum < S)  
            {  
                sum += num[e++];  
            }  
            if(sum < S)  
            {  
                break;  
            }  
            ans = min(ans ,e - s);  
            sum -= num[s++];  
        }  
}

高精度 ：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
char a1[23333],b1[23333];
int a[23333],b[23333],c[23333],lena,lenb,lenc;
void jia()
{
    scanf("%s%s",&a1,&b1);
    lena = strlen(a1);
    lenb = strlen(b1);
    for(int i = 0; i < lena;i ++) a[lena - i] = a1[i] - '0';
    for(int i = 0; i < lenb;i ++) b[lenb - i] = b1[i] - '0';
    int x = 0;
    for(lenc = 1;lenc <= max(lena,lenb);lenc ++)
    {
        c[lenc] = a[lenc] + b[lenc] + x;
        x = c[lenc] / 10;
        c[lenc] %= 10;
    }
    c[lenc] = x;
    if(c[lenc] == 0) lenc --;
    for(int i = lenc;i >= 1; i --) cout << c[i];
}
void jian()
{
    string a,b;  
    cin >> a >> b;  
    if (a.size()<b.size()||(a.size()==b.size()&&a<b)) 
    {  
        swap(a,b);  
        cout<<"-";  
    }  
    for (int i = 1;i <= b.size();i ++) a[a.size()-i] = a[a.size()-i]-b[b.size()-i]+'0'; 
    for (int i = 1;i <= a.size();i ++)  
    {  
        if (a[a.size()-i] < '0')     
        {  
            a[a.size()-i-1] -= 1;  
            a[a.size()-i] += 10;  
        }  
    }  
    for (lenc = 0;lenc < a.size();lenc++) if(a[lenc] != '0') break;
    if(lenc == a.size()) puts("0");
    for (int i = lenc;i < a.size();i ++) if (a[i] >= '0' && a[i] <= '9') cout << a[i];  
} 
void cheng()
{
    scanf("%s%s",&a1,&b1) ;
    lena = strlen(a1) ;
    lenb = strlen(b1) ;
    for(int i = 0;i < lena; i ++) a[lena - i - 1] =  a1[i] - '0';
    for(int i = 0;i < lenb; i ++) b[lenb - i - 1] =  b1[i] - '0';
    for(int i = 0;i < lena;i ++)
    for(int j = 0;j < lenb; j++) c[j + i] += a[i] * b[j];
    for(int i = 0;i < lena + lenb ; i ++)
    {
        if(c[i] >= 10)
        {
            c[i + 1] += c[i] / 10;
            c[i] = c[i] % 10;
        }
    }
    lenc = lena + lenb - 1;
    while(c[lenc]  == 0 && lenc != 0) lenc--;
    for(;lenc >= 0;lenc --) printf("%d",c[lenc]);
}
int main()
{
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    memset(c,0,sizeof(c));
    jia();
    jian();
    cheng();
    return 0;
}