CCF 201703-1 分蛋糕

CCF 201703-1 分蛋糕

题目比较简单，注意逻辑细节即可。上满分代码：

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String[] line = scanner.nextLine().split(" ");
		int n = Integer.parseInt(line[0]);
		int k = Integer.parseInt(line[1]);
		
		int[] cakes = new int[n];
		for(int i=0 ; i<n ; i++) {
			cakes[i] = scanner.nextInt();
		}
		
		int count = 0;
		int i=0;
		while(i<n) {
			int temp = cakes[i];
			while(temp<k && i<n-1) {
				i++;
				temp += cakes[i];
			}
			if(temp>=k) {
				count++;
			}else {
				if(i==n-1)count++;
			}
			i++;
		}
        System.out.print(count);
	}
}