冷月之殇

#include #include #include #include #include using namespace std;#define lowbit(x) ((-x)&x)#define INF 1000000000const int maxn=100005;const int mod=9901;int a[maxn],b[maxn],c[maxn],f[maxn];

#include #include #include #include #include #include using namespace std;const int maxn=1e4+10;const int maxc=1e6+10;struct node{ int to,w; node(int a=0,int b=0){to=a;w=b;}};int f[

#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include using namespace std;const int maxn=40004;struct node{ int to,w; node(int

#include #include #include #include #include using namespace std;#define LL __int64#define lowbit(x) (x&(-x))const LL mod=1e9+7;const LL maxn=500050;LL a[maxn],b[maxn],c[maxn],f[maxn],ans[ma

#include #include #include #include #include using namespace std;#define lowbit(x) (x&(-x))const int maxn=3000030;const int maxc=10010;int n,c[maxc],a[maxn];void add(int x,int val){ whi

#include #include #include #include #include #include using namespace std;const int maxn=505;const int maxm=25005;int f[maxn];struct node{ int a,b,w;}e[maxm];int find(int x){ if(x

#include #include #include #include #include #include using namespace std;const int maxn=10010;const int maxm=100010;int f[maxn],vis[maxn];struct node{ int a,b,w;}e[maxm];int find(int

/*哈夫曼树编码*/#include #include #include using namespace std;int a[30];char s[1001];int cmp(int a,int b){ return a>b;}int main(){ while(gets(s)) { if(strcmp(s,"END")==0