摘要:
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e3 + 10, inf = 0x3f3f3f3f; // 优先队列(最小堆),用于存储叶结点的权值 priority_queue<i 阅读全文
摘要:
#include<bits/stdc++.h> using namespace std; int main() { int a,b,maxx = 0,ans; //maxx是最大上课时间,ans是最不开心的一天 for(int i = 1; i <= 7; i++) { cin >> a >> b; 阅读全文
摘要:
#include<bits/stdc++.h> using namespace std; int main() { int n,minn = 9999999; //公理:求最小值时,要初始化最大 cin >> n; for(int i = 1; i <= n; i++) //循环n次 { int a 阅读全文
摘要:
#include<bits/stdc++.h> using namespace std; int main() { int m,t,s; //m个苹果,t分钟吃一个,总时间s cin >> m >> t >> s; int n = s / t; //理论上s分钟吃了n个 if(s % t != 0) 阅读全文
摘要:
#include<bits/stdc++.h> #define f(i,s,e) for(int i = s; i <= e; i++) #define ll long long using namespace std; const int N = 1e3+10,inf = 0x3f3f3f3f; 阅读全文
摘要:
#include<bits/stdc++.h> #define f(i,s,e) for(int i = s; i <= e; i++) #define ll long long using namespace std; const int N = 1e3+10,inf = 0x3f3f3f3f; 阅读全文