H-Sum 3s
时间: 1ms 内存:128M
描述:
You are given a number sequence a1,a2,a3...,an , your task is to find if there is a pair of interger (i,j) that ai+a(i+1)+..+aj equals to 0 and i<=j;
输入:
Input consists of multiple test cases. For each case, the first line of input contains an integer n, the next line follows n integers. (n>=1 && n<=10^5 |ai|<=10^4)
输出:
For each case, if there is at least one pair of integer (i,j) meet the requirement, print “YES”, otherwise print “NO” .
示例输入:
5
1 2 3 4 5
5
3 4 -2 -3 1
示例输出:
NO
YES
提示:
参考答案:
解锁文章
文章评论