![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
uva(含LA)
dreams_fly_oyzx
这个作者很懒,什么都没留下…
展开
-
uva 11292
uva 11292简单的贪心#include#include#include#include#include#includeusing namespace std;#define MAXNM (20000+5)int dra[MAXNM], per[MAXNM];int main(){ int n, m; while(原创 2016-05-17 10:40:19 · 178 阅读 · 0 评论 -
uva 11549
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)struct tnode{ double ti; bool LR; bool operator <(const tnode &a)const原创 2016-05-17 11:14:41 · 215 阅读 · 0 评论 -
uva 11549
#include#include#include#include#include#include#include#includeusing namespace std;int n, k;set s;int next(int a){ stringstream ss; ss << (long long) k*k; string s = ss.str(); if(原创 2016-05-17 11:13:23 · 178 阅读 · 0 评论 -
uva 11078
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int read[MAXN];int main(){ int T; scanf("%d", &T); while(T--){ int原创 2016-05-17 11:12:35 · 131 阅读 · 0 评论 -
uva 11462
#include#include#include#include#include#includeusing namespace std;#define MAXA (100+5)int age[MAXA];void init(){ memset(age, 0, sizeof(age));}int main(){ int n; while(scanf("%d",原创 2016-05-17 11:11:01 · 146 阅读 · 0 评论 -
La 3177
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int n;int r[MAXN];int r1[MAXN], r2[MAXN];bool check(int num_p){ i原创 2016-05-17 11:09:49 · 184 阅读 · 0 评论 -
LA 3902
#include#include#include#include#include#include#includeusing namespace std;#define MAXN (1000+5)int n, s, k;vector con[MAXN], nodes[MAXN];int f[MAXN];bool cover[MAXN];void init(){ f原创 2016-05-17 11:08:18 · 255 阅读 · 0 评论 -
uva 11520
#include#include#include#include#include#includeusing namespace std;#define MAXN (10+5)char read[MAXN][MAXN];int main(){ int T; scanf("%d", &T); int t = 0; while(T--){ int n;原创 2016-05-17 11:07:31 · 150 阅读 · 0 评论 -
La 3635
#include#include#include#include#include#includeusing namespace std;#define MAXN (10000+5)const double PIE = acos(-1.0);int n, f;double s[MAXN];bool check(double now){ int sum = 0; fo原创 2016-05-17 11:06:41 · 303 阅读 · 0 评论 -
La 3971
#include#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (1000+5)#define MAXC (20+5)struct node{ int id, gd, pr;};int n原创 2016-05-17 11:05:32 · 352 阅读 · 0 评论 -
uva 10795
#include#include#include#include#include#includeusing namespace std;#define MAXN (60+5)int start[MAXN], final[MAXN];long long dfs(int* begin, int now, int n_z){ if(!now) return 0; if(be原创 2016-05-17 11:04:33 · 177 阅读 · 0 评论 -
La 3401
#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (4+5)#define MAXR (24+5)vector names;int dic[24][6] = {{2,1,5,0,4,3}, {2,原创 2016-05-17 11:00:50 · 333 阅读 · 0 评论 -
LA 2995
#include#include#include#include#include#includeusing namespace std;#define RED(i,n) for(int i = 0; i (n); i++)#define MAXN (10+5)int n;char view[6][MAXN][MAXN], pos[MAXN][MAXN][MAXN];原创 2016-05-17 10:56:31 · 217 阅读 · 0 评论 -
uva 10881
#include#include#include#include#include#includeusing namespace std;#define MAXN (10000+5)struct node{ int num; int wz; char cx; bool operator<(const node a)const{ return wz < a.wz;原创 2016-05-17 10:53:25 · 174 阅读 · 0 评论 -
uva 1388
uva 1388#include#include#include#include#include#includeusing namespace std;#define MAXN (1000000+5)long long per_g[MAXN], give[MAXN];int main(){ int n; while(scanf("%d", &原创 2016-05-17 10:52:00 · 128 阅读 · 0 评论 -
uva 11300
uva 11300#include#include#include#include#include#includeusing namespace std;#define MAXN (1000000+5)long long per_g[MAXN], give[MAXN];int main(){ int n; while(scanf("%d", &n)原创 2016-05-17 10:48:49 · 209 阅读 · 0 评论 -
uva11729
uva 11729任务执行时间长的先交代#include#include#include#include#include#includeusing namespace std;#define MAXN (1000+5)struct node{ int b, j; bool operator <(const node &a)const{原创 2016-05-17 10:45:46 · 191 阅读 · 0 评论 -
La2678
#include#include#include#include#include#includeusing namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int read[MAXN], pre[MAXN];int main(){ int n, s; while(scanf("%d%d", &原创 2016-05-17 11:15:58 · 233 阅读 · 0 评论