AliceBuJu

暂时存着……QAQvoid init(){ int i,j; for(i=0;i<n;++i) stmin[i][0]=stmax[i][0]=a[i]; for(i=0;i<n;++i){ for(j=1;i+(1<<j)-1<n;++j){ stmin[i][j]=min(stmin[i][j-1],stmin[i+(1<<(j

void read(int &a){ a=0; int h=1; char c=getchar(); while(c<'0'||c>'9') { if(c=='-') h=-1; c=getchar(); } while(c>='0'&&c<='9') { a*=

加法#include<cstdio>#include<iostream>#include<cstring>#include<cmath>using namespace std;char a[500],b[500];int lenc,lena,lenb;int ca[500],cb[500],cc[500];void add(){ lena=strlen(a); le

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#define ll long long#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;const ll maxn

01背包问题 采药 二维#include<cstdio>#include<iostream> #include<cstring>using namespace std;int t,m;const int maxn=1005;int v[maxn],tm[maxn],dp[maxn][maxn];int main(){ memset(v,0,sizeof(v));