add a lot

Author: oeddyo

a.out

@@ -0,0 +1,41 @@
+#include <iostream>
+using namespace std;
+
+int A, B;
+void get_ans(int &res, int all, int div){
+    if(all<div){
+        return ;
+    }
+    
+    int sum = div;
+    int cnt = 1;
+    int cur = -1;
+    int rec = -1;
+    while(sum<=all){
+        cur = sum;
+        rec = cnt;
+        sum += sum;
+        cnt += cnt;
+    }
+    int left = all-cur;
+    res += rec;
+    get_ans(res, left, div);
+}
+
+
+void work(){
+    int ans;
+    get_ans(ans, A,B);
+    cout<<"ans = "<<ans<<endl;
+}
+
+
+int main(){
+    cin>>A>>B;
+
+    work();
+
+
+    return 0;
+}
+

blog/divide_without_divide.cpp

@@ -0,0 +1,9 @@
+#include <iostream>
+
+using namespace std;
+
+int main(){
+
+    return 0;
+}
+

cf/175/A.cpp

@@ -2,37 +2,58 @@
 
 using namespace std;
 
-const int MAXN = 100001;
-int tree[MAXN*8],N,T, lazy[MAXN*8];
+const int MAXN = 120001;
+int tree[MAXN*8],N,T;
+int lazy[MAXN*8];
+int cur_case;
+//int sum[MAXN*8];
+
 
 void pushUp(int idx){
     tree[idx] = tree[idx*2] + tree[idx*2+1];
 }
 
+void pushDown(int idx, int m){
+    if(lazy[idx]){
+        lazy[idx<<1] = lazy[idx<<1|1]= lazy[idx];
+        tree[idx<<1] = (m-(m>>1))*lazy[idx];
+        tree[idx<<1|1] = (m>>1)*lazy[idx];
+        lazy[idx] = 0;
+    }
+}
 void build(int l, int r, int idx){
     if(l==r){
         tree[idx] = 1;
+        lazy[idx] = 0;
         return;
     }
     int m = (l+r)>>1;
     build(l, m, idx*2);
     build(m+1, r, idx*2+1);
     pushUp(idx);
 }
+/*
+void build(int l, int r, int idx){
+    lazy[idx] = 0;tree[idx] = 1;
+    if(l==r)return;
+    int m = (l+r)>>1;build(l,m,idx*2);build(m+1,r,idx*2+1);
+    pushUp(idx);
+}
+*/
 
 void insert(int L, int R, int l, int r, int idx, int value){
-    cout<<"now idx = "<<idx<<endl;
     if(L<=l && r<=R){
-        cout<<"inserting "<<L<<" to "<<R<<" idx = "<<idx<<" value = "<<value<<endl;
-        tree[idx] = (R-L+1)*value;
+        tree[idx] = (r-l+1)*value;
+        lazy[idx] = value;
         return ;
     }
+    pushDown(idx, r-l+1);
     int m = (l+r)>>1;
     if(L<=m){
-        insert(L, m, l, m, idx*2, value);
+        insert(L, R, l, m, idx*2, value);
     }
     if(R>m){
-        insert(m+1, R, m+1, r, idx*2+1, value);
+        insert(L, R, m+1, r, idx*2+1, value);
     }
     pushUp(idx);
 }
@@ -43,20 +64,18 @@ void work(){
     memset(tree,0,sizeof(tree));
     memset(lazy,0,sizeof(lazy));
     build(1,N,1);
-    cout<<"ops = "<<ops<<endl;
     for(int i=0; i<ops; i++){
         int a,b,c;
         scanf("%d %d %d",&a,&b,&c);
         insert(a,b,1,N,1,c);
     }
-    cout<<tree[1]<<endl;
+    cout<<"Case "<<cur_case<<": The total value of the hook is "<<tree[1]<<"."<<endl;
 }
 
-
-
 int main(){
     scanf("%d",&T);
     for(int t=1; t<=T; t++){
+        cur_case = t;
         scanf("%d",&N);
         work();
     }

hdoj/1698.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <string>
+
+
+using namespace std;
+
+const int MAXN = 500000;
+string T;
+int failure[MAXN];
+bool mark[MAXN];
+void work(){
+    memset(mark,0,sizeof(mark));
+    failure[0] = failure[1] = 0;
+    int M = T.length();
+    for(int i=2; i<=M; i++){
+        int j = failure[i-1];
+        for(;;){
+            if(T[i-1]==T[j]){
+                failure[i] = j+1;
+                break;
+            }
+            if(j==0){
+                failure[i] = 0;
+                break;
+            }
+            j = failure[j];
+        }
+    }
+    /*
+    cout<<"print failure"<<endl;
+    for(int i=0; i<=M; i++){
+        cout<<failure[i]<<" ";
+    }
+    cout<<endl;
+    */
+
+    int t = M;
+    while(1){
+        if(t == 0)break;
+        mark[t] = 1;
+        t = failure[t];
+    }
+
+    for(int i=1; i<M; i++){
+        if(mark[i]){
+            cout<<i<<" ";
+        }
+    }
+    cout<<M<<endl;
+}
+
+
+int main(){
+    while(cin>>T){
+        work();
+    } 
+    return 0;
+}
+

hdoj/a.out

@@ -0,0 +1,146 @@
+#include <cstring>
+#include <cstdio>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+const int MAXN = 20001;
+
+int num[MAXN], stp, N, K;
+int P[20][MAXN], height[MAXN], mapping[MAXN];
+
+struct entry {
+    int nr[2];
+    int p;
+}L[MAXN];
+
+bool mycmp(struct entry a, struct entry b){
+    return a.nr[0]==b.nr[0]?(a.nr[1]<b.nr[1]?1:0):(a.nr[0]<b.nr[0]?1:0);
+}
+
+int lcp(int x, int y){
+    int k,ret =0;
+    if(x==y)return N-x;
+    for(k=stp-1; k>=0 && x<N && y<N; k--){
+        if(P[k][x]==P[k][y]){
+            x+= 1<<k, y+=1<<k, ret += 1<<k;
+        }
+    }
+    return ret;
+}
+
+void myprint(int start, int end){
+    for(int i=start; i<=end; i++){
+        cout<<num[i];
+    }
+}
+
+
+void build_sa(){
+    for(int i=0; i<N; i++){
+        P[0][i] = num[i];
+    }
+    int cnt = 1;
+    for(stp=1; cnt>>1 < N ; cnt<<=1, stp+=1){
+        for(int i=0; i<N; i++){
+            L[i].nr[0] = P[stp-1][i];
+            L[i].nr[1] = i+cnt<N?P[stp-1][i+cnt]:-1;
+            L[i].p = i;
+        }
+        sort(L,L+N,mycmp);
+        for(int i=0; i<N; i++){
+            P[stp][L[i].p] = i>0 && L[i].nr[0]==L[i-1].nr[0] && L[i].nr[1]==L[i-1].nr[1]? P[stp][L[i-1].p]:i;
+        }
+    }
+    /*
+    for(int i=0; i<N; i++){
+        cout<<P[stp-1][i]<<" ";
+    }cout<<endl;
+    */
+
+    for(int i=0; i<N; i++){
+        mapping[ P[stp-1][i] ] = i;
+    }
+    /*
+    cout<<"begin printing"<<endl;
+    for(int i=0; i<N; i++){
+        myprint(mapping[i], N-1);
+        cout<<endl;
+    } 
+    */
+
+    height[0] = 0;
+    for(int i=1; i<N; i++){
+        height[i] = lcp(mapping[i-1], mapping[i]);
+    }
+    /*
+    for(int i=0; i<N; i++){
+        cout<<"height["<<i<<"] = "<<height[i]<<endl;
+    }
+    */
+}
+
+
+bool judge(int len){
+    bool in = false;
+    int count = 0, ans = 0;
+    bool ok = true;
+    
+    for(int i=0; i<N; i++){
+        if(height[i]>=len && in){
+            //cout<<"at pos "<<i<<" continue add 1"<<endl;
+            count++;
+        }else if(height[i]>=len && !in){
+            //cout<<"at pos "<<i<<" initial 1"<<endl;
+            in = true;
+            count = 1;
+        }else if(height[i]<len){
+            //cout<<"at pos "<<i<<" go out set 0"<<endl;
+            in = false;
+            ans = max(ans, count);
+            count = 0;
+        }
+    }
+    ans = max(ans, count);
+    ans+=1;
+    //cout<<"checking length = "<<len<<" count = "<<ans<<endl;
+    if(ans>=K){
+        return true;
+    }return false;
+}
+
+
+void work(){
+    int low = 0, high = N-1;
+    int ans = 0;
+    while(low<=high){
+        //cout<<"low = "<<low<<" high = "<<high<<endl;
+        int mid = (low+high)/2;
+        if(judge(mid)){
+            low = mid+1;
+            ans = mid;
+        }else{
+            high = mid-1;
+        }
+    }
+    cout<<ans<<endl; 
+}
+
+
+int main(){
+    
+    
+    while(scanf("%d %d", &N, &K)!=EOF){
+
+        for(int i=0; i<N; i++){
+            scanf("%d", &num[i]);
+
+        }
+        build_sa();
+        work();
+    }
+
+    return 0;
+}
+