显示原始代码
#include <bits/stdc++.h>
using namespace std;
long long l[200005], r[200005], a[200005], b[200005], c[200005];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%lld%lld", &l[i], &r[i]);
for (int i = 1; i <= m; i++) scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
int ansi = 0, ansj = 0;
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
long long lans = c[j] * (min(b[j], r[i]) - max(a[j], l[i]));
if (lans > ans) {
ans = lans;
ansi = i;
ansj = j;
}
}
}
cout << ans << endl;
if (ans != 0)
cout << ansi << " " << ansj;
return 0;
}
