L-qf 的博客

题目信息#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int main() { int n,m,a[10005]; while(cin>>n>>m) { for(int i=0; i<n; i++) cin...

题目信息#include<cstdio>#include<iostream>using namespace std;int main() { int n,i,sum,ans,a[105]; while(~scanf("%d",&n)) { sum=0; ans=0; for(i=0; i&l...

题目信息 #include<cstdio>#include<iostream>#include<algorithm>using namespace std;int main() { int sum,n,m; int a[9005]; while(~scanf("%d%d",&n,&m)) { ...

题目信息#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;struct bag { double j; double f; double v;} a[1005];int ...

题目信息#include<stdio.h>#include<algorithm>using namespace std;bool complare (int a,int b){ return a>b;}int main(){ int i,a[600],l,n; while(scanf("%d%d",&l,&n...

题目信息#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int main() { int n; double w; while(cin>>n&&amp...

题目信息#include<cstdio>#include<iostream>#include<algorithm>#define N 50005using namespace std;struct line { int s; int e;} a[N];int cmp(line x,line y) {//将线段按照 左端点从小到大排序，如...

题目信息#include<cstdio>#include<iostream>#define N 10005#include<algorithm>using namespace std;struct ac { int s;//开始时间 int e;//结束时间 } a[N];int cmp(ac x,ac y) { if(x.s==y....

题目信息#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int cmp(int x,int y){ return x>y;}int main(){ int a[26]; string ...

题目#include<cstdio>#include<iostream>#define N 50005#include<algorithm>using namespace std;int main() { int n; long long a[N];//注意范围 （假设每个都是最大或最小值，就会超出int 范围） while(cin&gt...