Volume 4. Algorithm Design
关注
分享
扫一扫
LeeBooL
这个作者很懒，什么都没留下…
展开
-
UVA 10602
#include #include #include #include #include using namespace std;#define maxn 105bool vis[maxn];int order[maxn];int main(){ char fir[maxn]; int n, t; char str[maxn][maxn];原创 2014-11-19 23:02:27 · 294 阅读 · 0 评论 -
UVA 10954
#include #include #include #include #include #include using namespace std;priority_queueint, vectorint>, greaterint> >que;int main(){ int n, val; while(scanf("%d",&n) != EOF && n原创 2014-11-28 23:44:37 · 358 阅读 · 0 评论 -
UVA 10716
#include #include #include #include using namespace std;char str[111];int num[30];int solve( int len){ int ans = 0; for( int i = 0 ; i len/2; i++) { int j = len - 1 -原创 2014-11-28 23:43:30 · 431 阅读 · 0 评论 -
UVA 11054
#include #include #include #include using namespace std;#define LL long long#define MAXN 100100int main(){ int n; while(scanf("%d",&n) != EOF && n) { LL last = 0; LL原创 2014-11-28 23:48:00 · 261 阅读 · 0 评论 -
UVA 10487
#include #include #include #include #include using namespace std;#define maxn 10010int num[maxn], que, n, ans, m;int solve( int sum){ int L = 0, R = n -1 ; int res = 0x1f1f1f1f;原创 2014-11-28 23:39:47 · 409 阅读 · 0 评论 -
UVA 270
#include#include#include#include#include#include#includeusing namespace std;struct node{ int x,y; node(){} node(int a,int b){x=a;y=b;}};int main(){ //freope原创 2014-11-28 23:49:49 · 343 阅读 · 0 评论 -
UVA 10714
#include #include #include #include #include using namespace std;#define MAXN 1000000 + 10int pos[MAXN];int main(){ int t; scanf("%d",&t); while(t--) { int len, n;原创 2014-11-28 23:37:57 · 389 阅读 · 0 评论 -
UVA 10718
#include #include #include #include using namespace std;#define LL unsignedint main(){ LL n,l,r,m; while(scanf("%u %u %u", &n, &l, &r) !=EOF) { int m = 0; for( int原创 2014-11-28 23:38:47 · 445 阅读 · 0 评论 -
UVA 10763
#include #include #include #include #include using namespace std;map, int > list;int main(){ int n, a, b; while(scanf("%d",&n) != EOF && n) { list.clear(); int cnt原创 2014-11-28 23:46:58 · 312 阅读 · 0 评论 -
UVA 10057
#include #include #include #include #include using namespace std;#define MAXN 1000000 + 10int num[MAXN];int main(){ int n; int x1, x2; while(scanf("%d",&n) != EOF) { bo原创 2014-11-28 23:50:39 · 425 阅读 · 0 评论 -
UVA 108
#include #include #include #include using namespace std;#define MAXN 1111int mar[MAXN][MAXN];int main(){ int n, val; while(scanf("%d", &n) != EOF && n) { memset(mar, 0,原创 2014-11-28 23:42:05 · 397 阅读 · 0 评论 -
UVA 311
#include#include#include#includeusing namespace std;int main(){ int a,b,c,d,e,f; int sum,flag; int t,t1; while(1) { sum=0; scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e原创 2014-11-28 23:39:30 · 319 阅读 · 0 评论 -
uva 10487
#include #include #include #include using namespace std;const int N = 1005;const int INF = 0x3f3f3f3f;int set[N];int query[N];int n,m;int solve(int num) { //二分查找最近的和 int left = 0,right = n-原创 2014-11-19 23:34:58 · 356 阅读 · 0 评论 -
UVA 10487
UVA 10487#include #include #include #include #include using namespace std;bool cmp(string a,string b){ return (a+b)>(b+a);}int main(){ //freopen("in","r",stdin); in原创 2014-11-28 23:41:07 · 313 阅读 · 0 评论 -
UVA 10020
#include #include #include #include #include using namespace std;#define maxn 100000 + 10struct Node{ int l, r; int len;} node[maxn];int ans[maxn];int cmp ( Node a, Node b){原创 2014-11-28 23:41:41 · 403 阅读 · 0 评论 -
UVA 10026
#include #include #include #include #include using namespace std;#define MAXN 1010struct node{ double fan; int id;}task[MAXN];int cmp( node a, node b){ if(a.fan != b.fan)原创 2014-11-28 23:44:03 · 472 阅读 · 0 评论 -
UVA 10382
#include #include #include #include #include #include using namespace std;#define MAXN 10010#define eps 1e-8struct node{ double l,r;}spr[MAXN];int cmp( node a, node b){ return a原创 2014-11-28 23:46:29 · 338 阅读 · 0 评论 -
UVA 10827
#include #include #include #include using namespace std;#define MAXN 200int num[MAXN][MAXN];int main(){ int t, n; scanf("%d",&t); while(t--) { scanf("%d",&n);原创 2014-11-28 23:48:27 · 440 阅读 · 0 评论 -
UVA 10132
#include #include #include #include #include #include using namespace std;#define N 500string str[N];map m;int main () { char s[N]; int n; cin >> n; getchar(); gets(s); while (n--)原创 2014-11-28 23:48:59 · 355 阅读 · 0 评论 -
UVA 757
#include #include #include #include #include using namespace std;#define MAXN 30int ans[MAXN], tmp[MAXN];int h, n;struct node{ int no, rate, cut, time; friend bool operator const原创 2014-11-28 23:51:13 · 477 阅读 · 0 评论 -
UVA 10706
#include #include #include #include #include #include using namespace std;#define K sqrt(2147483647) + 1#define MAXN 1001000#define LL long longchar num[MAXN];LL sum[MAXN];int fan( int原创 2014-11-28 23:51:47 · 407 阅读 · 0 评论 -
UVA 562
#include #include #include #include #include using namespace std;#define MAXN 1111int coin[MAXN];bool dp[111111];int main(){ int t; scanf("%d",&t); while(t--原创 2014-12-03 21:55:09 · 357 阅读 · 0 评论