Codeforces Round #532 (Div. 2)
2024-10-19 17:49:51
Codeforces Round #532 (Div. 2)
#include<bits/stdc++.h> #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<vector> #include<map> #define lson i<<1 #define rson i<<1|1 #define LS l,mid,lson #define RS mid+1,r,rson #define mem(a,x) memset(a,x,sizeof(a)) #define gcd(a,b) __gcd(a,b) #define ll long long #define ull unsigned long long #define lowbit(x) (x&-x) #define pb(x) push_back(x) #define enld endl #define mian main #define itn int #define prinft printf #pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") const double PI = acos (-1.0); const int INF = 0x3f3f3f3f; ; ; ; ; using namespace std; int n, k, ans; ]; int cnt1, cnt2; int main() { cin >> n >> k; cnt1 = cnt2 = ans = ; ; i <= n; ++i) { cin >> a[i]; ) { cnt1++; } else { cnt2++; } } int t1, t2; ; i <= ; ++i) { t1 = t2 = ; ; i + j * k <= n; ++j) { ) { t1++; } ) { t2++; } } ans = max(ans, abs((cnt1 - t1) - (cnt2 - t2))); } cout << ans << endl; }
A
#include<bits/stdc++.h> #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<vector> #include<map> #define lson i<<1 #define rson i<<1|1 #define LS l,mid,lson #define RS mid+1,r,rson #define mem(a,x) memset(a,x,sizeof(a)) #define gcd(a,b) __gcd(a,b) #define ll long long #define ull unsigned long long #define lowbit(x) (x&-x) #define pb(x) push_back(x) #define enld endl #define mian main #define itn int #define prinft printf #pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") const double PI = acos (-1.0); const int INF = 0x3f3f3f3f; ; ; ; ; using namespace std; int n, m, tmp; queue<int> q; queue<int> qt; int vis[MAXN]; int main() { cin >> n >> m; ; i <= m; ++i) { cin >> tmp; if(!vis[tmp]) { q.push(tmp); } vis[tmp]++; if(q.size() == n) { int cnt = n; while(cnt--) { vis[q.front()]--; if(vis[q.front()]) q.push(q.front()); q.pop(); } cout << ; } else cout << ; } cout << endl; }
B
C
#include<bits/stdc++.h> #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<vector> #include<map> #define lson i<<1 #define rson i<<1|1 #define LS l,mid,lson #define RS mid+1,r,rson #define mem(a,x) memset(a,x,sizeof(a)) #define gcd(a,b) __gcd(a,b) #define ll long long #define ull unsigned long long #define lowbit(x) (x&-x) #define pb(x) push_back(x) #define enld endl #define mian main #define itn int #define prinft printf #pragma GCC optimize(2) //#pragma comment(linker, "/STACK:102400000,102400000") const double PI = acos (-1.0); const int INF = 0x3f3f3f3f; ; ; ; ; using namespace std; double n,r; int main() { cin>>n>>r; printf(-sin(PI/n))*r); }
C
最新文章
- Caffe Python MemoryDataLayer Segmentation Fault
- cmd执行SQL语句
- Android性能优化篇
- 一个方法告诉你as3的removeChild性能有多烂
- Linux内核源代码的结构(转)
- ANT教程经典
- DuiLib(二)——控件创建
- PHP如何抓取https内容?记录一下。
- SVN强制注释
- DEDECMS织梦常用二开自定义标签
- PHP MySQL Delete
- WebPack引用Bootstrap 无法使用图标的结局方案
- Solr 14 - SolrJ操作SolrCloud集群 (Solr的Java API)
- Ex 7_17 考虑如下的网络(其中数字为对应边的容量)...第十三次作业
- Xcode 8.X Command Line Tools
- 8.Mysql数据类型选择
- VB数组的清除
- 摄影EV值深入研究
- 自定义圆角ImageView控件
- paramiko的安装与使用