地址:http://codeforces.com/contest/988/problem/C
类似于一些后一个与前一个产生关系的题目的做法
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200005;
int a[N];
int main()
{
map<int,pair<int,int> >mp;
int k;
scanf("%d",&k);
bool flag = false;
int tmp,ans;
for(int i = 1;i <= k;++i)
{
int n;
scanf("%d",&n);
int sum = 0;
for(int j = 1;j <= n;++j)
{
scanf("%d",&a[j]);
sum += a[j];
}
for(int j = 1;j <= n;++j)
{
if(mp.count(sum - a[j]) && mp[sum - a[j]].first != i){
printf("YES\n");
printf("%d %d\n",mp[sum - a[j]].first,mp[sum - a[j]].second);
printf("%d %d\n",i,j);
return 0;
}
else{
mp[sum - a[j]].first = i;
mp[sum - a[j]].second = j;
}
}
}
printf("NO\n");
return 0;
}