B. Tanya and Candies-Codeforces Round #540 (Div. 3)

思路：①滚动数组 ②删后，右数性质取反，奇->偶，偶->奇

#include<stdio.h>
//int t = 0;
int main()
{
	int primer[200006];
	int odd[200006] ={0};
	int even[200006] = {0};
	int n;
	int candy=0;
	scanf("%d",&n);
	for(int i=1; i<=n; i++){
		scanf("%d",&primer[i]);
	}
	for(int i=1; i<=n; i++){
		if(i % 2 == 1){
			odd[i] = odd[i-1]+primer[i];
			even[i] = even[i-1];
		}
		else{
			odd[i] = odd[i-1];
			even[i] = even[i-1]+primer[i];
		}
	}
	for(int i=1; i<=n; i++){
		int endo=0, ende=0;
		endo = odd[i-1]+(even[n]-even[i]);
		ende = even[i-1]+ (odd[n]-odd[i]);
		if(endo == ende){
			candy++;
		}
	}
	printf("%d",candy);