# Monthly Archives: September 2015

## Poj Solution 3264

http://poj.org/problem?id=3264 //* @author: 82638882@163.com import java.io.*; public class Main { static int[][] q=new int[160001][17]; static int[][] p=new int[160001][17]; public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); String[] ss=in.readLine().split(" "); int n=Integer.parseInt(ss[0]); int k=Integer.parseInt(ss[1]); … Continue reading

## Poj Solution 3259

http://poj.org/problem?id=3259 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class edge{ int s,t,l; public void set(int _s,int _t,int _l){ this.s = _s; this.t = _t; this.l = _l; } } public class Main { static int M = 6000,N = 500+20,Inf … Continue reading

## Poj Solution 3256

http://poj.org/problem?id=3256 //* @author: SmilingWang import java.util.*; public class Main { static LinkedList< Integer> set = new LinkedList< Integer>(); static TreeSet< Integer> tmset = new TreeSet< Integer>(); static int[][] path; static boolean[][] use; static ArrayList[] table; public static void main(String[] args){ … Continue reading

## Poj Solution 3253

http://poj.org/problem?id=3253 import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] nodes = new int[n]; for (int i = 0; i < n; i++) { nodes[i] … Continue reading

## Poj Solution 3252

http://poj.org/problem?id=3252 import java.io.BufferedReader; import java.io.InputStreamReader; import java.math.BigInteger; public class Main { static long[] arr = new long[] { 0, 0, 1, 2, 6, 11, 27, 49, 113, 206, 462, 848, 1872, 3458, 7554, 14030, 30414, 56747, 122283, 229045, 491189, 923099, … Continue reading

## Poj Solution 3250

http://poj.org/problem?id=3250 import java.util.Scanner; import java.util.Arrays; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int n,i; int p[]=new int[80010],q[]=new int[80010]; n=sc.nextInt(); for(i=0;i< n;i++) p[i]=sc.nextInt(); for(i=0;i< n;i++) q[i]=1; p[n]=1000000010; for(i=n-1;i>=0;i–) { int u=p[i+1]; while(p[i]>p[i+q[i]]) q[i]+=q[i+q[i]]; } long total=0; … Continue reading

## Poj Solution 3233

http://poj.org/problem?id=3233 //* @author: import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.PrintWriter; public class Main{ static int n, k, m; static int[][] matrix; static int[][] result; /** * ������a��Ԫ�ظ��Ƶ�����һ������ * * @param a * @return */ static int[][] copy(int[][] a) { int[][] re … Continue reading

## Poj Solution 3226

http://poj.org/problem?id=3226 //* @author:alpc12 import java.io.*; import java.util.*; import java.math.*; public class Main { BigInteger[][] Ank = new BigInteger[27][27]; void pre() { BigInteger i, j; for(i = BigInteger.ONE; i.compareTo(new BigInteger("27")) != 0; i = i.add(BigInteger.ONE)) { Ank[i.intValue()][0] = BigInteger.ONE; Ank[i.intValue()][1] = … Continue reading