摘要:
#include#include#includeusing namespace std;const int MAXN = 200005;int mark[MAXN b ? a : b;}void Max(int rt){ mark[rt] = max( mark[rt > 1; bui... 阅读全文
posted @ 2015-07-17 23:57
杨永华
阅读(120)
评论(0)
推荐(0)
摘要:
import java.util.Scanner;import java.math.BigInteger;public class Main{ public static void main(String[] args){ Scanner in = new Scanner(Sys... 阅读全文
posted @ 2015-07-17 22:13
杨永华
阅读(145)
评论(0)
推荐(0)
摘要:
import java.util.Scanner;import java.math.BigDecimal;public class Main{ public static void main(String[] args){ Scanner in = new Scanner(System.in); ... 阅读全文
posted @ 2015-07-17 20:19
杨永华
阅读(173)
评论(0)
推荐(0)
摘要:
第一个线段树,参考别人代码#include#include#include#include#includeusing namespace std;const int MAXN = 55555;int sum[MAXN > 1; build(l, mid, rt > 1; if(p = r... 阅读全文
posted @ 2015-07-17 19:28
杨永华
阅读(118)
评论(0)
推荐(0)
摘要:
#include#include#include#include#includeusing namespace std;const int MIN = -1u >> 1;int main(){ double a,b; char s1[1000],s2[1000]; char c; ... 阅读全文
posted @ 2015-07-17 10:01
杨永华
阅读(141)
评论(0)
推荐(0)