标签：rem code cat ini weight std mes specific print
Tanya has nn candies numbered from 11 to nn. The ii-th candy has the weight aiai.
She plans to eat exactly n?1n?1 candies and give the remaining candy to her dad. Tanya eats candies in order of increasing their numbers, exactly one candy per day.
Your task is to find the number of such candies ii (let‘s call these candies good) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days. Note that at first, she will give the candy, after it she will eat the remaining candies one by one.
For example, n=4n=4 and weights are [1,4,3,3][1,4,3,3]. Consider all possible cases to give a candy to dad:
In total there 22 cases which should counted (these candies are good), so the answer is 22.
The first line of the input contains one integer nn (1≤n≤2?1051≤n≤2?105) — the number of candies.
The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1041≤ai≤104), where aiai is the weight of the ii-th candy.
Print one integer — the number of such candies ii (good candies) that if dad gets the ii-th candy then the sum of weights of candies Tanya eats in even days will be equal to the sum of weights of candies Tanya eats in odd days.
超时。。。
#include <iostream> using namespace std; int main() { int n; cin>>n; int i,a[10005],ready[10005][5],day=1; for(i=0;i<n;i++) { cin>>a[i]; } int j; ready[0][1]=0; ready[0][2]=0; for(j=0,day=1;j<n;j++,day++){ if(day%2==1){ ready[day][1]=ready[day-1][1]+a[j]; ready[day][2]=ready[day-1][2]; } else{ ready[day][1]=ready[day-1][1]; ready[day][2]=ready[day-1][2]+a[j]; } } int count=0,k,sum1=0,sum2=0,all=day-1; // cout<<ready[all][1]<<" "<<ready[all][2]<<endl; for(k=0;k<n;k++){ // for(day=1,sum1=0,sum2=0,i=0;i<n;i++){ // if(i==k) continue; // if(day%2==1) sum1+=a[i]; // else sum2+=a[i]; // day++; // } // day=k+1; sum1=ready[k][1]+ready[all][2]-ready[k+1][2]; sum2=ready[k][2]+ready[all][1]-ready[k+1][1]; if(sum1==sum2) { // cout<<sum1<<" "<<sum2<<endl; count++; } } cout<<count<<endl; return 0; }
标签：rem code cat ini weight std mes specific print
原文地址：https://www.cnblogs.com/shengge-777/p/10404351.html
