2016年07月_Change_ZHONG

原创 c++优先队列的基本使用方法

#include#include#includeusing namespace std;struct node{ friend bool operator< (node n1, node n2) { return n1.priority "为从小打到排列 } int priority; int value;};int main(

2016-07-31 20:16:50 2479

原创 tjut 4302

#include#include#include#includeusing namespace std;struct cmp{ bool operator()(int x,int y) { return x>y; }};priority_queue,cmp>q;priority_queueq2;int main(){ int T

2016-07-31 20:05:42 163

原创 tjut 4300

#include #include #include using namespace std;int nxt[100005];char str[27];char s1[100005],s2[100005];void getnext(char *t){ int i = 0,j = -1; nxt[0]=-1; while(t[i]) {

2016-07-31 18:55:36 155

原创 tjut 4696

#include #include #include #include #include #include #include #include #include #include using namespace std; int t[100005]; int c[100005]; int m; int main() {

2016-07-31 17:39:20 162

原创 tjut 4705

#include#include#include#includeusing namespace std;#define MAXN 100100#pragma comment(linker, "/STACK:16777216")struct Edge{ int v,next;}edge[MAXN*4];int NE;long long n;int head[MAXN

2016-07-31 17:14:20 153

原创 tjut 4699

#include #include #define INF -10000000 int s1[1000001],s2[1000001],dp[1000001],pos1,pos2; int sum[1000001]; int Max(int a,int b){ return a>b?a:b; } int main(){ int cas;

2016-07-31 16:32:08 168

原创 tjut 4704

#include#include#includeusing namespace std;const int MAX=100005;const int mod=1000000007;char s[MAX];long long pow(long long a,long long b){ long long base=a,r=1; while(b!=0) {

2016-07-31 16:06:53 259

原创 tjut 4687

#include #include #include #include #include #include #include #include #include #include using namespace std; const int maxn = 55; int n,m,Match[maxn],Head,Tail,Queue[maxn],St

2016-07-31 15:47:56 197

原创 tjut 4689

#include #include #include #include #include #include #include using namespace std; typedef long long ll; const int N = 22; int n; ll d[N][N]; bool vis[N][N]; char str[N]

2016-07-31 14:48:41 185

原创 nyoj119

#include #include #include using namespace std; const int N = 100010; int maxsum[N][20], minsum[N][20]; void RMQ(int num) //预处理->O(nlogn) { for(int j = 1; j < 20; ++j)

2016-07-31 10:51:03 283

原创 tjut 4691

#include #include #include using namespace std; #define N 100100 int sa[N],t[N],t2[N],c[N]; char ss[N]; int s[N]; void build_sa(int n,int m) { int *x=t,*y=t2; for(i

2016-07-31 10:01:30 252

原创 tjut 4686

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;const int MOD = 1e9+7;struct Matrix{ int mat[5][5];

2016-07-31 08:39:37 287

原创 tjut 5777

#includeusing namespace std;const int N=1e5+7;int a[N],t,n,k;int main(){ scanf("%d",&t); while(t--) { scanf("%d%d",&n,&k); for(int i=2;i<=n;i++)scanf("%d",a+i);

2016-07-31 08:25:14 219

原创 tjut 1205

#include using namespace std; int main() { int ncases; scanf("%d",&ncases); while(ncases--) { __int64 maxvalue=-1,sweetkinds,sum=0; scanf("%I64u",&sweetkinds);

2016-07-31 08:16:30 261

原创 tjut 5776

//#pragma comment(linker, "/STACK:102400000, 102400000")#include #include #include #include #include #include #include #include #include #include #include using namespace std;typedef long

2016-07-31 08:01:45 255

原创 tjut 4679

#pragma comment(linker, "/STACK:1024000000,1024000000") #include#include#define N 100001int n,head[N],num,vis[N],dp[N][3],dp1[N][2],min,iid;struct edge{ int st,ed,next,w,id;}E[N*2];void a

2016-07-30 17:32:29 164

原创 tjut 1159

#include #include int f[1001][1001];//**1001*1001太大不能定义在主函数，否则直接停止编译**// int main() { char a[1001],b[1001]; int i,j,len1,len2; while(~scanf("%s %s",a,b)) { le

2016-07-30 17:03:06 243

原创 tjut 4681

#include #include #include #include #include #include #include #include #include #include #define LL long long using namespace std; const int MAXN = 1000 + 10; char

2016-07-30 16:59:46 223

原创 tjut 4669

#include #include #include #define M 50005 #define K 205 int mod[M], sum[M], dp[M][K], p[200005]; int n, k; void POW() { p[0] = 1; for(int i = 1; i <= 4*n; ++i) p[i] = (

2016-07-30 16:17:52 243

原创 tjut 1785

#include #include #include using namespace std; struct point{ double x,y; bool operator < (const point&rhs) const { return atan2(y,x) < atan2(rhs.y,rhs.x); } }a

2016-07-30 14:51:57 190

原创 tjut 4667

#include #include #include #include #include #include using namespace std; const double eps=1e-10; const double pi=acos(-1.0); struct point { double x,y; int s,o;

2016-07-30 14:41:37 176

原创 tjut 1880

#include #include #include using namespace std;const int N = 100010;const int H = 100007;struct Node{ char que[25]; char ans[85]; int next;};Node nodeA[N], nodeB[N];int curA,

2016-07-30 13:39:55 213

原创 tjut 4666

#include #include #include #include #include #include #include #include #include #include #include using namespace std;int a[60010][10];multisetmst[1<<5];int main(){ //freopen("in.

2016-07-30 12:14:39 292

原创 tjut 4664

include #include typedef long long ll; #define N 1002 bool vis[N]; int sg[N]; int a[] = {4,8,1,1,2,0,3,1,1,0,3,3,2,2,4,4,5,5,9,3,3,0,1,1,3,0,2,1,1,0,4,5,3,7}; int SG(int x) { if

2016-07-30 10:04:06 173

原创 tjut 4655

#include #include #include #include using namespace std; #define LL __int64 const LL mod=1e9+7; LL a[1000001],b[1000001]; LL pows(LL a,LL b) { LL s=1; a=a%mod;

2016-07-30 09:55:30 155

原创 tjut 4655

#include #include #include #include #include #include using namespace std; #define maxn 1000010 typedef __int64 LL; vectorv; const LL mod = 1e9+7; LL num[maxn]; LL Pow

2016-07-30 08:59:51 226

原创 tjut 3062

#include#includeconst int maxn = 3000; struct node{ int v,next;}eg[maxn*maxn];int head[maxn];int dfn[maxn],low[maxn],sta[maxn],insta[maxn],belong[maxn];int tot,color,top,Index,n;void add

2016-07-29 21:37:08 201

原创 tjut 4665

#include #include #include #include using namespace std;const int MAXN = 2020;int a[MAXN];int s[MAXN];char ans[MAXN];bool flag ;int n;void dfs(int cur,int t1,int t2){ if(flag)return;

2016-07-29 21:31:57 212

原创 tjut 1561

#include #include #include #include using namespace std; int N,M,v[223]; vectorson[223]; int dp[223][223]; void dfs(int n,int left){ int i,j,k,len=son[n].size(); d

2016-07-29 20:52:26 134

原创 tjut 2669

#include int exgcd(int a,int b,int &x,int &y) { int i,j; if(b==0) { x=1; y=0; return a; } i=exgcd(b,a%b,x,y); j=x; x=y;

2016-07-29 20:44:51 220

原创 tjut 1576

#include #include #define m 9973 void Extend_gcd(int a,int b,int &x,int &y) { if(b==0) { x=1,y=0; return ; } Extend_gcd(b,a%b,x,y); in

2016-07-29 20:28:17 186

原创 tjut 4661

#pragma comment(linker,"/STACK:100000000,100000000") #include #define LL __int64 const int mod = 1000000007; const int maxn = 1000003; struct EDGE{ int to, next; }edge[maxn*2];

2016-07-29 20:23:21 177

原创 tjut 4662

#include #include #include using namespace std; int main() { int testcase; cin>>testcase; while(testcase--) { string p="MI"; int counti=1,co

2016-07-29 19:47:18 174

原创 tjut 4643

#include #include const double eps = 1e-8;inline int dcmp(double x) { if(fabs(x) < eps) return 0; return x > eps ? 1 : -1;}struct point { double x, y; point(double x, double y) :

2016-07-29 17:34:46 139

原创 tjut4649

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ls 2*i #define rs 2*

2016-07-29 16:04:28 178

原创 tjut 4651

#include #include #include #include using namespace std; const int mod=1e9+7; int f[100010]; void init() { f[0]=1; int i,j,k,flag=1; for(i=1;i<=100000;i++)

2016-07-29 15:34:56 161

原创 tjut 4647

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ls 2*i #define rs 2*

2016-07-29 15:18:06 181

原创 tjut 4648

#include #include #include #include #include #include using namespace std; // const int V = 100000 + 50; const int MaxN = 80 + 5; const int mod = 10000 + 7; const __i

2016-07-29 15:01:34 182

原创 tjut 4639

#include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int64; //typedef __int64 int64; typedef pair

2016-07-29 12:39:12 218

原创 tjut 1269

/*2012-12-06 20:16:08 Accepted 1269 46MS 1484K 1339 B C++*/ #include #include #include using namespace std; #define maxn 10010 int n; vector g[maxn]; int Bcnt; /

2016-07-29 11:44:01 202

空空如也

空空如也