大家好,又见面了,我是全栈君,今天给大家准备了Idea注册码。
For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it’s formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.
You are to write a program that will count the amounts of the stars of each level on a given map.
5 1 1 5 1 7 1 3 3 5 5
1 2 1 1 0
直接统计不大于当前数的个数,然后hash记录。
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <set> #include <stack> #include <cctype> #include <algorithm> #define lson o<<1, l, m #define rson o<<1|1, m+1, r using namespace std; typedef long long LL; const int mod = 99999997; const int MAX = 0x3f3f3f3f; const int maxn = 15050; const int N = 32005; int n, a, b; int c[N], ans[maxn]; int main() { while(~scanf("%d", &n)) { memset(c, 0, sizeof(c)); memset(ans, 0, sizeof(ans)); int k = 0; for(int i = 1; i <= n; i++) { scanf("%d%d", &a, &b); a++; int sum = 0; for(int j = a; j > 0; j -= j&(-j)) sum += c[j]; for(int j = a; j <= N; j += j&(-j)) c[j]++; ans[sum]++; } for(int i = 0; i < n; i++) printf("%d\n", ans[i]); } return 0; }
版权声明:本文博主原创文章,博客,未经同意不得转载。
发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/117088.html原文链接:https://javaforall.cn
【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛
【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...