B. Integers Shop
#include
#include
#include
using namespace std;
const int N = 1e5 + 10;
typedef pair
typedef long long ll;
int n;
void solve() {
cin >> n;
int A = 1e9 + 1;
int minl = (int)1e9 + 1, maxr = 0;
int maxlen = 0;
int cosl = A, cosr = A, cosrl = A;
for (int i= 0; i < n; i ++) {
int l, r, c;
cin >> l >> r >> c;
if (l < minl) {
minl = l;
cosl = A;
}
i
共有 0 条评论