![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树状数组
阿文施瓦辛格
这个作者很懒,什么都没留下…
展开
-
E. Ultra-QuickSort
E. Ultra-QuickSortTime Limit: 7000msCase Time Limit: 7000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 2418Font Size: + -In this problem, you have原创 2014-05-19 19:45:48 · 444 阅读 · 0 评论 -
F,Japan
#include#include#includeusing namespace std;typedef struct node{ int x; int y;}as;as a[1000001];int c[1003];int n,m,k;bool cmp(node aa,node bb){ if(aa.x==bb.x) return aa.y return aa.x}int lowbit(int原创 2014-05-19 19:45:57 · 422 阅读 · 0 评论 -
C mobile phones
C. Mobile phonesTime Limit: 5000msCase Time Limit: 5000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit StatusFont Size: + -Suppose that the fourth generation mob原创 2014-05-19 19:45:55 · 352 阅读 · 0 评论 -
G Iversions
G. InversionsTime Limit: 500msCase Time Limit: 500msMemory Limit: 4096KB64-bit integer IO format: %I64d Java class name: SolutionSubmit Status PID: 10387Font Size: + -There are N integers (1A[j].原创 2014-05-19 19:45:53 · 325 阅读 · 0 评论 -
D Cows
#include#include#includeusing namespace std;typedef struct node { int w; int x; int y;}node;node a[100001];int c[100001];int n;bool cmp(node a,node b){ if(a.y==b.y) return a.x return a.y>b.y;}int lowb原创 2014-05-19 19:46:00 · 359 阅读 · 0 评论 -
A 敌兵布阵
A. 敌兵布阵Time Limit: 1000msCase Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 5379Font Size: + -C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他原创 2014-05-19 19:45:50 · 503 阅读 · 0 评论 -
B Stars
B. StarsTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 2471Font Size: + -Astronomers often examine star maps原创 2014-05-19 19:46:02 · 417 阅读 · 0 评论