Div2:简单
https://www.jisuanke.com/contest/5251
A:签到题;
B : 开两个栈,一个操作,另一个为单调栈,记录最大值;
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<stack>
using namespace std;
stack<int>s1,s2;
int n,x,y;
void solve()
{
cin >> n;
for(int i = 1;i <= n;i ++)
{
cin >> x;
if(x == 1)
{
cin >> y;
s1.push(y);
if(s2.empty() || s2.top() <= y) //注意有等于号;
s2.push(y);
}
else if(x == 2)
{
if(!s2.empty() && s2.top() == s1.top())
s2.pop();
s1.pop();
}
else if(x == 3)
{
if(s2.empty()) cout << 0 << endl;
else cout << s2.top() << endl;
}
}
return;
}
int main()
{
solve();
return 0;
}
C:
想了一会儿,打了一个全排列用来找规律,发现大数尽量和大数一起乘,小数尽量和小数一起乘,这样最大;
因此可以把序列看作一个环,最大的数为中心,向两边分别递减,最后为两个小数汇合;
然后拆成一条链计算;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const long long MAXN = 1000001;
long long a[MAXN],b[MAXN];
ll n;
bool cmp(ll a,ll b)
{
return a > b;
}
void solve()
{
cin >> n;
ll l = 1,r = n;
for(ll i = 1;i <= n;i ++) cin >> a[i];
sort(a + 1,a + n + 1,cmp);
for(ll i = 1;i <= n;i ++)
{
if(i % 2) b[l ++] = a[i];
else b[r --] = a[i];
}
ll ans = 0;
for(ll i = 1;i <= n;i ++)
ans += b[i] * b[i + 1 == n ? n : (i + 1) % n];
cout << ans;
}
int main()
{
solve();
return 0;
}
D:
可以求出每个人的位置到出口的曼哈顿距离,然后从小到大排序,如果当前距离小于等于前一个,需要前一个走完再走,所以dis[i] = dis[i - 1] + 1;
这个题的难点?在于理解题意,英语太烂了,读了半天没明白什么意思……;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int r,s,q,x,y;
int dis[200001];
void solve()
{
cin >> r >> s >> q;
for(int i = 1;i <= q;i ++)
{
cin >> x >> y;
if(y > s) y ++;
dis[i] = abs(x - r - 1) + abs(y - s - 1);
}
sort(dis + 1,dis + q + 1);
for(int i = 1; i <= q;i ++)
dis[i] = (dis[i] <= dis[i - 1]? dis[i - 1] + 1:dis[i]);
cout << dis[q] << endl;
return;
}
int main()
{
solve();
return 0;
}
E:
待办
F:
待办