dailygoing的专栏

//0.140s #include<iostream> #include<queue> #include<cstring> #include<vector> using namespace std; const int maxn = 100005; const int inf = 1 << 30; int i, a, ...

#include<iostream> #include<vector> #include<ctime> #include<algorithm> #include<cstdio> using namespace std; int n, maxd; int wrongn(int *p, int a, int b) { ...

//uva1451，0.07s //贪心算法，求平均值最大的子序列 //数形结合，求最大斜率 #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; const int N = 100005; i...

//uva11093 //贪心算法，加油站环路，O(n) #include<iostream> #include<algorithm> #include<cstdio> using namespace std; const int N = 100005; int n,res,i,j,d,T,t,s; int p[N], x[N]; in...