csp：跳一跳，碰撞的小球 java

 

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int score=0,flag,add=0;
		Scanner in=new Scanner(System.in);
		for(int i=0;;i++)
		{
			flag=in.nextInt();
			if(flag==0)
				break;
			if(flag==1)
			{
				score+=1;
				add=1;
			}
			if(flag==2)
			{
				if(i==0||add==1)
					add=2;
				else
					add+=2;
				score+=add;
			}
		}
		System.out.println(score);

	}

}

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		Ball ball[]=new Ball[n];
		int L=in.nextInt();
		int t=in.nextInt();
		for(int i=0;i<n;i++)
		{
			int site=in.nextInt();
			ball[i]=new Ball(i,site,true);//true表示向右，false左
		}
		Sortsite sortsite=new Sortsite();
		Arrays.sort(ball,sortsite);
		for(int i=0;i<t;i++)
		{
			for(int j=0;j<n;j++)
			{
				if(ball[j].direction==true)
					ball[j].site++;
				else
					ball[j].site--;
				if(ball[j].site==0||ball[j].site==L)
					ball[j].direction=!ball[j].direction;
				if(j!=0&&ball[j].site==ball[j-1].site)
				{
					ball[j].direction=!ball[j].direction;
					ball[j-1].direction=!ball[j-1].direction;
				}
			}
		}
		Sortpos sortpos=new Sortpos();
		Arrays.sort(ball,sortpos);
		for(int j=0;j<n-1;j++)
		{
		System.out.print(ball[j].site+" ");
		}
		System.out.println(ball[n-1].site);

	}

}
class Ball{
		boolean direction;
		int site;
		int pos;
		public Ball(int pos,int site, boolean direction) {
			this.pos=pos;
			this.site=site;
			this.direction=direction;
		}

}
class Sortsite implements Comparator<Ball>{

	public int compare(Ball arg0, Ball arg1) {
		return arg0.site-arg1.site;
	}
}
class Sortpos implements Comparator<Ball>{
	public int compare(Ball arg0, Ball arg1) {
		return arg0.pos-arg1.pos;
	}
}