for (j = 0; j < M; j++) { for (int m = 0; m < M; m++) { if (b[j][m] != 0) { cout << "b[j][m]" << b[j][m] << " " << "j" << j << " " << m << endl; double q = (x - j)*(x - j) + (y - m)*(y - m); cout << "q" << q << endl; e[i] = q; if (mp[e[i]] != 0)mp[e[i]] += b[j][m]; else mp[q] = b[j][m]; i++; } } } for (j = 0; j < i; j++)cout << e[j]<<endl; sort(e, e + i); for (j = 0; j < i; j++)cout << e[j] <<" "<<mp[e[j]]<<endl; j = 0; while(mp[e[j]]<=L&&j<i){ if (e[j + 1] == e[j]) j++; L = L + mp[e[j]]; j++; cout << "L" << L<<"i"<<i<<" "<<j<<endl; } cout << L << endl; } return 0; }
点赞 评论

相关推荐

牛客网
牛客网在线编程
牛客网题解
牛客企业服务