kib吧
关注: 12 贴子: 117

  • 0
    RT
    TS大曹 2-17
  • 0
    Kib吧也是很多代码啊!缘分啊!
  • 0
    标题党。。 其实膜拜教主。。。
  • 6
    0.0.0.* 2010-05
    #include <iostream> #include <fstream> #include <cstdlib> #include <cstring> #include <cmath> #include <vector> #define INF 1000000000 #define MAXL 50005 using namespace std; ifstream fin("jewelry.in"); ofstream fout("jewelry.out"); class ACnode {      public:          bool s;          ACnode * next[26];          long Lnum,Rnum;          ACnode() {memset(next,0,sizeof(next));Lnum=R
    0.0.0.* 5-16
  • 3
    RT 不解释 APIO GOLD!!! 膜拜!!!!
    Pro_KiB 5-14
  • 2
    0.0.0.* 2010-04
    #include <iostream> #include <cstdio> #include <cmath> using namespace std; class Ynode {      public:          long L,R,max;          Ynode * left, * right;          Ynode(){L=R=max=-10;left=right=NULL;} }; class Ytree {      public:          Ynode * root;          Ytree(){root=NULL;}          void b
    0.0.0.* 4-20
  • 2
    #include <iostream> #include <fstream> #define INF 1000000000 #define Loop 28 using namespace std; class Enode {      public:          long k,d;          Enode * next;          void clear()          {k=d=0;next=NULL;}          Enode(){clear();} }; Enode * ta[30]; bool vis[30]; long dist[30]; long cnt[30]; long que[30],Head,Tail; long R[30]; long H[30],n; void qin(lo
    0.0.0.* 3-23
  • 0
    0.0.0.* 2010-02
    #include <iostream> #include <queue> #define INF 1000000000 using namespace std; class Qn {      public:          long id; }; long n; long W[15005],L[15005],P[15005]; long S[15005],C[15005]; long ans=INF; void init() {      long i;      cin >> n;      for(i=1;i<=n;i++)      {          cin >> W[i] >> L[i] >> P[i];          S[i]=S[i-1]+W[i];
    0.0.0.* 2-21
  • 1
    0.0.0.* 2010-02
    #include <iostream> #include <fstream> #include <algorithm> #include <queue> #include <cstring> #define INF 1000000000 using namespace std; class point {      public:          long long x,y;          long long v;          point(){x=y=0;v=0;}          bool operator <(point p)          {return x<p.x || (x==p.x && v<0);} }; class Lnod
    0.0.0.* 2-20
  • 1
    0.0.0.* 2010-02
    #include <iostream> #include <fstream> #include <stack> #define INF 1000000000 using namespace std; stack<long> sop; long n,m; class BSTn {      public:          long key;          BSTn * left , * right , * father ;          BSTn(long k=0)          {key=k;left=right=father=NULL;} }; class BST {      public:          BSTn * root; &nbsp
    0.0.0.* 2-18
  • 1
    0.0.0.* 2010-02
    #include <iostream> #include <fstream> #include <cstdlib> #include <cstring> #include <string> #include <vector> #include <utility> #include <cmath> #define INF 1000000000 using namespace std; typedef pair< long , long > Enode; long N,Q,S; vector< Enode > ta[300005]; long vis[300005],Vn; long Line1[300005]; long Line2[300005]; long RA[300005][20]; long size[300005]; long height[300005]; long where[300005]; long logt[300005]; long A[300005],B[300005]; long Tsum[300005]; void add(long x,long y) {      while(x<=N)
    0.0.0.* 2-16
  • 4
    小菜是来膜拜神牛的~
  • 1

  • 发贴红色标题
  • 显示红名
  • 签到六倍经验

赠送补签卡1张,获得[经验书购买权]

扫二维码下载贴吧客户端

下载贴吧APP
看高清直播、视频!

本吧信息 查看详情>>

会员: 会员

目录: 个人贴吧

大家都在搜
  • kib什么意思
  • kib 魔兽
  • kib岁微博
  • 电子狗说的kib什么意思
  • kid发音
  • nice怎么读
  • kib和g怎么换算
  • beet
  • kids
  • sick
  • doctor读音
  • kid怎么读
  • firs
  • go home
  • KIB killed in
  • kid岁
  • thirty
  • staysing
  • kindness in need
  • kib多大
  • problem kib什么意思
  • Kib和KiB
  • kentucky
  • quick