13 条回复
用的暴力求解,只通过33%,想看正确答案
import java.util.Scanner;
public class meituanOne {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int N = sc.nextInt();
int [] arr=new int[N];
int i = 0;
while(sc.hasNext()&&i<N){
arr[i] = sc.nextInt();
i++;
}
int K=sc.nextInt();
int j = 0,k = 0,sum = 0,ANS = 0;
for (i=0;i<=N;i++){
for(j = 0;j+i<=N;j++){
sum = 0;
for(k=0;k<i;k++){
sum+=arr[j+k];
}
if(sum%K == 0){
ANS = i;
}
}
}
System.out.println(ANS);
}
}
添加回复