Gao The Sequence
2013-04-01 13:35
225 查看
Gao The Sequence
计算出一个差值数组C[i], 一种操作, 找一个delate有C[i]-=delaie,找任意多个C[j]-=D[j] (j<i) 使sum(D[j])=delate, 问能否使C[i]全部赋0.
View Code
计算出一个差值数组C[i], 一种操作, 找一个delate有C[i]-=delaie,找任意多个C[j]-=D[j] (j<i) 使sum(D[j])=delate, 问能否使C[i]全部赋0.
View Code
#include<cstdio> #define ll long long int main(){ int n; while(~scanf("%d",&n)){ ll a,b,c,s=0,m=0; while(n--){ scanf("%lld%lld",&a,&b); c=a-b;s+=c; if(c>m)m=c; } puts(s&1||s<m<<1?"NO":"YES"); } return 0; }
相关文章推荐
- zoj Gao The Sequence
- C - Gao The Sequence
- ZOJ3672:Gao The Sequence
- zoj 3672 Gao The Sequence
- ZOJ Monthly, November 2012 - G - Gao The Sequence
- zoj3672 Gao The Sequence
- zoj - 3672 - Gao The Sequence
- ZOJ 3672 Gao The Sequence
- 数组空间Given a sequence of numbers (or array).Find the maximum distance between all the same numbers.
- theme css style sequence
- CareerCup the maximum longest continous sequence of 0s
- codeforces438 D The Child and Sequence
- Divide the Sequence
- hdu_5783_Divide the Sequence(贪心)
- HDOJ 5783 Divide the Sequence(贪心)
- UVA 694 - The Collatz Sequence
- 建立“共享”序列【CREATE SEQUENCE OF THE SHARED】
- 2016 Multi-University Training Contest 5 1003 Divide the Sequence
- POJ3982-The Fibonacci sequence
- MDT 2010 – The task sequence has been suspended