蓝桥冲刺刷题准备-----------

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;

public class Main {
	static int a [] = new int [1000010];
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
	public static void main(String agrs[]) throws NumberFormatException, IOException {
		int n = Integer.parseInt(br.readLine());
		String s [] = br.readLine().trim().split(" +");
		for(int i=0;i<n;i++) {
			a[i]=Integer.parseInt(s[i]);
		}
		Arrays.sort(a,0,n);
		long ans = 0;
		for(int i=n-1;i>=0;i=i-2) {
			ans+=a[i];
		}
		System.out.println(ans);
	}
}

import java.util.Scanner;

public class Main {
	static int n,m;
	static int []dx = {1,0,-1,0};
	static int []dy = {0,-1,0,1};
	static int [][] h = new int [110][110];
	static int [][] b = new int [110][110];
	public static void main(String ags[]) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				h[i][j] = sc.nextInt();
			}
		}
		int ans = 0;
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				ans = Math.max(ans,dfs(i,j));
			}
		}
		System.out.println(ans);
	}
	static int dfs(int x,int y) {
		if(b[x][y]!=0)return b[x][y];
		b[x][y] = 1;
		for(int i=0;i<4;i++) {
			int tx = x+dx[i];
			int ty = y+dy[i];
			if(tx>=0&&tx<n&&ty>=0&&ty<m&&h[tx][ty]<h[x][y]) {
				b[x][y] = Math.max(b[x][y], dfs(tx,ty)+1);
			}
		}
		return b[x][y];
	}
}

 

 

---

package 后缀和数组;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

//aab
public class aab {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static int s[][] = new int [100010][26];
	public static void main(String args[]) throws NumberFormatException, IOException {
		int n = Integer.parseInt(br.readLine());
		String str = br.readLine();
		for(int i=n-1;i>=0;i--) {
			for(int j=0;j<26;j++) {
				s[i][j]=s[i+1][j];
			}
			char c = str.charAt(i);
			s[i][c-'a']++;
		}
		long res = 0;
		for(int i=0;i<n;i++) {
			for(int j=0;j<26;j++) {
				if(str.charAt(i)-'a'!=j) {
					res+=s[i+1][j]*(s[i+1][j]-1)/2;
				}
			}
		}
		System.out.println(res);
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static long a [] = new long [1010]; 
	static long sn [] = new long [1010];
	public static void main(String agrs[]) throws IOException {
		String s [] = br.readLine().split(" ");
		int n = Integer.parseInt(s[0]);
		int k = Integer.parseInt(s[1]);
		s = br.readLine().split(" ");
		for(int i=1;i<=n;i++) {
			a[i]=Long.parseLong(s[i-1]);
		}
		long [][] dp = new long [n+1][k];
		for(int i=0;i<=n;i++) {
			Arrays.fill(dp[i], Long.MIN_VALUE);
		}
		dp[0][0] = 0;
		for(int i=1;i<=n;i++) {
			for(int j=0;j<k;j++) {
				dp[i][(int)((j+a[i])%k)]=Math.max(dp[i-1][j]+a[i],dp[i-1][(int)((j+a[i])%k)]);
			}
		}
		if(dp[n][0]<=0) {
			System.out.println(-1);
		}else {
			System.out.println(dp[n][0]);
		}
		
	}
}