总结

链接:https://vjudge.net/contest/378052#problem

package SA;
import java.util.*;

public class Main {
	
	public static void main(String args[]) {
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];
        for(int i = 0; i < n; i++) {
        	arr[i] = sc.nextInt();
        }
        sc.close();
        int r1 = 0;
        int a1 = -1;
        for(int i = 0; i < n-1; i++) {
			if(arr[i+1] - arr[i] == 1) {
				if(arr[i] == 1) {
					a1 += 2;
				} else if(arr[i+1] == 1000) {
					a1 += 2;
				} else {
					a1++;
				}
			} else {
				r1 = Math.max(r1, a1);
				a1 = -1;
			}
		}
		System.out.println(Math.max(r1, a1));
        
	}
}
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		int k = sc.nextInt();
		int len = str.length();
		char[] arr = str.toCharArray();
		int x = 48;
		int y = 0;
		int z = 0;
		while (k > 0 && z < len) {
			for (int i = z; i <= z + k && i < len; i++)
				if ((int) arr[i] > x) {
					x = (int) arr[i];
					y = i;
				}
			char p;
			for (int i = y; i > z; i--) {
				p = arr[i];
				arr[i] = arr[i - 1];
				arr[i - 1] = p;
			}
			k = k - y + z;
			z++;
			y = z;
			x = 48;
		}
		for (char o : arr)
			System.out.print(o + "");
		System.out.println();
	}
}
import java.util.Scanner;
public class Main
{
        public static void main(String args[]) throws Exception
        {
                Scanner sc=new Scanner(System.in);
                int n=sc.nextInt();
                int count=1,sum1=0,sum2=0,sum3=0;
                int a[]=new int [200010];
                boolean flag=false;
                sc.close();
                if(n==1) {
                	System.out.println("YES");
                	System.out.println("1 2 ");
                }else {
                	for(int i=1; i<=n; ++i) {
                    	a[i]=count;
                    	if(flag==false) {
                    		flag=true;
                    		count+=3;
                    	}
                    	else {
                    		flag=false;
                    		++count;
                    	}
                    	sum1+=a[i];
                    }
                    flag=false;
                    for(int i=n+1; i<=2*n; ++i) {
                    	if(flag==false) {
                    		flag=true;
                    		a[i]=a[i-n]+1;
                    	}
                    	else {
                    		flag=false;
                    		a[i]=a[i-n]-1;
                    	}
                    }
                    for(int i=n+2; i<=2*n; ++i)
                    	sum2+=a[i];
                    sum2+=a[1];
                    sum3=sum2-a[n+2]+a[2];
                    if(sum2!=sum1 && sum2!=sum1+1)
                    	System.out.println("NO");
                    else if(sum3!=sum1 && sum3!=sum1+1)
                    	System.out.println("NO");
                    else {
                    	System.out.println("YES");
                    	for(int i=1; i<=2*n; ++i) {
                    		System.out.print(a[i]+" "); 
                    	}
                    }
                }
        }
}
import java.util.*;
public class SAD {
 public static void main(String args[])
 {
	 Scanner sc=new Scanner(System.in);
	 int n=sc.nextInt();
	 String a=sc.next();
	 String b=sc.next();
	 int sum1=0,sum2=0,sum3=0,sum4=0;
	 long count=0;
	 for(int i=0;i<n;i++)
	 {
		 if(a.charAt(i)=='1'&&b.charAt(i)=='1')sum1++;
		 else if(a.charAt(i)=='0'&&b.charAt(i)=='1')sum2++;
		 else if(a.charAt(i)=='0'&&b.charAt(i)=='0')sum3++;
		 else sum4++;
	 }
	 count=(long)sum3*sum4+(long)sum1*sum3+(long)sum2*sum4;
	 System.out.println(count);
 }
}
 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值