re-organization; remove conflicted

Author: lebesgue

BZOJ/1013.cpp

@@ -62,4 +62,4 @@ int main ()
         printf ("%.3lf%c", sol[i], i==n? '\n' : ' ');
     }
     return 0;
-}
+}

Codeforces/341B_198.cpp

@@ -0,0 +1,31 @@
+#include <cstdio>
+#include <map>
+#include <cmath>
+
+using namespace std;
+
+int main () {
+	int i, j, k;
+	map<int, int>M;
+	int n, ans = 0;
+	scanf ("%d", &n);
+	M[0] = 0;
+	for (i = 1; i <= n; ++i) {
+		scanf ("%d", &j);
+		map<int, int>::iterator it = M.lower_bound(j);
+		k = (--it)->second + 1;
+		for (++it; it != M.end(); ) {
+			if(it->second <= k)
+				M.erase(it++);
+			else
+				break;
+		}
+		M[j] = k;
+		ans = max(ans, k);
+	}
+	printf("%d\n", ans);
+	return 0;
+}
+			
+		
+		

Codeforces/CF340C_198.scala

@@ -0,0 +1,11 @@
+object CF340C_198 extends App{
+  def gcd (x : Long, y : Long) : Long = {
+    if (x % y == 0) y else gcd (y, x % y)
+  }
+  val n = Console.readLine.toInt
+  val a = Console.readLine.split(' ').map(_.toLong).sorted.zip(1 to n).map{case (x, i) =>
+    (4 * i - 2 * n - 1) * x
+  }.reduce(_ + _)
+  val d = gcd(a, n)
+  printf("%d %d\n", a/d, n/d)
+}

PKU/PKU_3468_AC.cpp

@@ -0,0 +1,100 @@
+#include <iostream>
+#include <cstdio>
+
+#define LL(x) ((x)<<1)
+#define RR(x) ((x)<<1|1)
+#define X(rt) seg[(rt)].x
+#define Y(rt) seg[(rt)].y
+#define S(rt) seg[(rt)].sum
+#define D(rt) seg[(rt)].d
+
+using namespace std;
+
+const int N = 100010;
+
+struct node{
+	int x, y;
+	long long sum, d;
+}seg[N<<2];
+
+void build(int rt, int be, int en)
+{
+	X(rt) = be;
+	Y(rt) = en;
+	D(rt) = 0;
+	if(be == en){
+		scanf("%lld",&seg[rt].sum);
+//		printf("reading %d %lld\n", be, S(rt));
+		return;
+	}
+
+	int mid = (be + en) >> 1;
+	build(LL(rt), be, mid);
+	build(RR(rt), mid + 1, en);
+	S(rt) = S(LL(rt)) + S(RR(rt));
+}
+
+void insert(int rt, int be, int en, long long inc)
+{
+	if(be <= X(rt) && en >= Y(rt))
+	{
+		D(rt) += inc;
+		S(rt) += inc * (Y(rt) - X(rt) + 1);
+		return;
+	}
+	if(D(rt)){
+		insert(LL(rt), X(rt), Y(rt), D(rt));
+		insert(RR(rt), X(rt), Y(rt), D(rt));
+		D(rt) = 0;
+	}
+	int mid = (X(rt) + Y(rt) ) >> 1;
+	if(be <= mid)
+		insert(LL(rt), be, en, inc);
+	if(en > mid)
+		insert(RR(rt), be, en, inc);
+	S(rt) = S(LL(rt)) + S(RR(rt));
+}
+
+long long qry(int rt, int be, int en)
+{
+	if(be <= X(rt) && en >= Y(rt))
+		return S(rt);
+	if(D(rt)){
+		insert(LL(rt), X(rt), Y(rt), D(rt));
+		insert(RR(rt), X(rt), Y(rt), D(rt));
+		D(rt) = 0;
+	}
+	long long ans = 0;
+	int mid = (X(rt) + Y(rt)) >> 1;
+	if(be <= mid)
+		ans += qry(LL(rt), be, en);
+	if(en > mid)
+		ans += qry(RR(rt), be, en);
+	return ans;
+}
+
+int main()
+{
+	int i, j, n, q;
+	long long k;
+	char ch;
+
+	scanf("%d%d",&n, &q);
+	build(1, 1, n);
+	for(; q; q--)
+	{
+		getchar();
+		scanf("%c%d%d",&ch, &i, &j);
+		if(ch == 'C'){
+			scanf("%lld",&k);
+			insert(1, i, j, k);
+		}
+		else
+			printf("%lld\n", qry(1, i, j));
+	}
+	return 0;
+}
+
+
+
+

SGU/187_simul.cpp

@@ -0,0 +1,60 @@
+#include <cstdio>
+#include <algorithm>
+
+using namespace std;
+
+const int N = 4011;
+
+struct seg {
+	int be, en;
+}a[N];
+int n;
+
+void rev (int s, int t) {
+	int i, j;
+	for (i = s, j = t; i <= j; ++i, --j) {
+		swap (a[i], a[j]);
+		swap (a[i].be, a[i].en);
+		if (i != j) swap (a[j].be, a[j].en);
+	}
+}
+
+int getPos (int x) {
+	int j, k, i = 1;
+	while (x > 0) {
+		int size = abs (a[i].be - a[i].en) + 1;
+		if (x >= size) {
+			x -= size;
+			i++;
+		}
+		else {
+			int sgn = a[i].en >= a[i].be ? 1 : -1;
+			for (j = (++n); j > i + 1; a[j] = a[j - 1], --j);
+			a[i+1].be = a[i].be + sgn * x; a[i+1].en = a[i].en; a[i].en = a[i].be + sgn * (x - 1);
+			return i + 1;
+		}
+	}
+	return i;
+}
+
+int main () {
+	int i, j, k, m;
+	scanf ("%d%d", &k, &m);
+	n = 1;
+	a[1].be = 1; a[1].en = k;
+	for (; m; --m) {
+		scanf ("%d%d", &i, &j);
+		int x = getPos (i - 1);
+		int y = getPos (j); 
+		rev (x, y - 1);
+	}
+	for (k = 1; k <= n; ++k)
+		if (a[k].be <= a[k].en)
+			for (j = a[k].be; j <= a[k].en; printf ("%d ", j++));
+		else
+			for (j = a[k].be; j >= a[k].en; printf ("%d ", j--));
+	printf ("\n");
+	return 0;
+}
+
+

SGU/187_splay.cpp

@@ -0,0 +1,162 @@
+/*
+* SplayTree_econ.cpp
+*
+*  Created on: Jan 6, 2013
+*      Author: shuo
+*/
+
+#include <iostream>
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+
+using namespace std;
+
+const int N = 130011;
+
+struct Node {
+	// ch[0]: left child; ch[1]: right child
+	Node *ch[2], *p;
+	int v, size;
+	bool rvs;
+	Node () : v(0), size(0){}
+
+	/* Static */
+	bool R() {return this == p->ch[1];}
+
+	/* Static */
+	void setch (bool c, Node *x) {
+		ch[c] = x;
+		x->p = this;
+	}
+
+	/* Task specific */
+	void push_down () {
+		if (rvs) {
+			swap (ch[0], ch[1]);
+			ch[0]->rvs ^= 1;
+			ch[1]->rvs ^= 1;
+			rvs = false;
+		}
+	}
+
+	/* Task specific */
+	void update () {
+		size = ch[0]->size + ch[1]->size + 1;
+	}
+}memo[N];
+
+Node *snt, *root;
+int n, mpt = 0;
+
+/* Static */
+void rotate (Node *x) {
+	Node *f = x->p;
+	int c = x->R();
+	f->push_down (); x->push_down (); // is it necessary for x ?
+	f->setch (c, x->ch[!c]);
+	f->p->setch (f->R(), x);
+	x->setch (!c, f);
+	f->update ();
+	if (f == root) root = x;
+
+}
+
+/* Static */
+void splay (Node *x, Node *t) {
+	for (x->push_down (); x->p != t; ) {
+		if (x->p->p == t)
+			rotate (x);
+		else
+			(x->R() == x->p->R()) ? (rotate (x->p), rotate (x)) : (rotate (x), rotate(x));
+	}
+	x->update ();
+}
+
+
+/* Task specific */
+Node* newNode (int val) {
+	Node* u = &memo[mpt++];
+	u->v = val;
+	u->p = u->ch[0] = u->ch[1] = snt;
+	u->size = 1; u->rvs = false;
+	return u;
+}
+
+/* Task specific: probably interval operation */
+Node* build (int l, int r) {
+	if (l > r) return snt;
+
+	int mid = (l + r) / 2;
+	Node *u = newNode (mid);
+	if (l < r) {
+		u->setch (0, build (l, mid - 1));
+		u->setch (1, build (mid + 1, r));
+	}
+	u->update ();
+	return u;
+}
+
+Node* select (int rk) {
+	Node *u = root;
+	while (true) {
+		u->push_down (); // cannot be delayed
+		int j = u->ch[0]->size + 1;
+		if (rk == j) return u;
+		else if (rk > j) {
+			u = u->ch[1];
+			rk -= j;
+		}
+		else u = u -> ch[0];
+
+	}
+	return u;
+}
+
+void init () {
+	snt = &memo[mpt++];
+	root = build (0, n + 1);
+	snt->setch (0, root);
+}
+
+void reverse (int l, int r) {
+	Node *a = select (l);
+	Node *b = select (r + 2);
+	splay (a, snt);  splay (b, a);
+	b->ch[0]->rvs ^= 1;
+	splay (b->ch[0], snt); // still got AC if removed
+}
+
+
+void go (Node *u) {
+	if (u == snt) return;
+	u->push_down ();
+	go (u->ch[0]);
+	if (u->v != 0 && u->v != n + 1)
+		printf ("%d ", u->v);
+	go (u->ch[1]);
+}
+void output () {
+	go (root);
+	printf ("\n");
+}
+
+int main () {
+	int i, j, m;
+	//freopen ("in.txt", "r", stdin);
+	scanf ("%d%d", &n, &m);
+	init ();
+	for (; m; m--) {
+		scanf ("%d%d", &i, &j);
+		reverse (i, j);
+	}
+	output ();
+	return 0;
+}
+
+
+
+
+
+
+