因为第二天早上有英语课 所以这场是补的
题意 给你一本书 每一页都属于一个章节 给你n个章节的开始页码与结束页码 问你小C在第k页没看 还有多少个章节没看(包括当前没看的那个章节)
做法 就是二分找一下结束章节 然后答案为n-xb+1
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
int a[1025],b[1025];
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n,k,ans;
scanf("%d",&n);
for(int i = 1;i<=n;++i)
scanf("%d%d",&a[i],&b[i]);
scanf("%d",&k);
int xb = lower_bound(b+1,b+1+n,k)-b;
//dbg2(xb,b[xb]);
ans = n - xb+1;
printf("%d\n",ans);
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
题意 给你n长度的盘子 每个盘子上有一个石子盘子下有一个硬币 然后走路需要一个能量 扔石子需要一个能量 拿盘子里硬币要用一个能量 问你最低需要几个能量
做法 我们知道你第一个盘子的石子肯定要扔到任意一个有石子的盖子里 但是从第二个盘子开始 你就可以把所有石子扔到之前走过的盘子上 这样就显然 第一个盘子上的石子贡献了2 其他石子贡献n-1 然后你要确定走的方向 向左右两边小的地方走 +个minn 然后因为要走完 所以一定要回头走n-1个距离 然后捡硬币有n个贡献
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
int main()
{
int n,k;
scanf("%d%d",&n,&k);
int minn = min(n-k,k-1);
int ans = 2;
ans+=minn;//左边走
ans+=n-1;//右边走
ans+=n-1;
ans+=n;
printf("%d\n",ans);
return 0;
}
题意 给你两个矩阵 然后可以选正方形的矩阵沿着向右下的对角线翻转 问你A矩阵能否转换成B矩阵
通过这个转换我们发现 实际上你选矩阵就是再把向右上的对角线的元素翻转 选的矩阵大小只是确定翻转轴的大小 所以你只要判断向右上对角线上的元素是否相等 用一个multiset然后直接判断相等即可
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 525;
int mp[MAX_N][MAX_N],mp_[MAX_N][MAX_N];
multiset<int > st[1025],st_[1025];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 1;i<=n;++i)
for(int j = 1;j<=m;++j)
scanf("%d",&mp[i][j]);
for(int i = 1;i<=n;++i)
for(int j = 1;j<=m;++j)
scanf("%d",&mp_[i][j]);
for(int i = 1;i<=n;++i)
{
for(int j = 1;j<=m;++j)
{
st[i+j-2].insert(mp[i][j]);
st_[i+j-2].insert(mp_[i][j]);
}
}
bool flag = true;
for(int i = 0;i<=n+m-2;i++)
{
if(st[i]!=st_[i])
{
flag = false;
break;
}
}
if(flag) printf("YES\n");
else printf("NO\n");
return 0;
}
题意 给你n长度的队列 主角在最后一个人位置 两个人能交换满足m对关系u , v 并且 u 在 v前面正好一个距离
我们知道 交换相当于把前面的元素放后面 那我们就想着构造一种序列使得能和主角交换的人尽可能多的排在主角前面 这样主角能交换多少次就取决于这些人有多少个 有一个存在的问题是为什么不断满足条件的往右移动不会影响下个人 需要再研究一下
按照这个大体思路写的贪心代码如下
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 300025;
int arr[MAX_N],vis[MAX_N];
map<int,int >mp[MAX_N];
int main()
{
int n,m,a,b,ans = 0;
scanf("%d%d",&n,&m);
for(int i = 1;i<=n;++i)
{
scanf("%d",&arr[i]);
}
for(int i = 1;i<=m;++i)
{
scanf("%d%d",&a,&b);
mp[a][b] = 1;
if(b==arr[n]) vis[a] = 1;
}
for(int i = n-1;i>=1;i--)
{
if(vis[arr[i]])
{
for(int j = i + 1;j<n;j++)
{
if(mp[arr[j-1]].find(arr[j])!=mp[arr[j-1]].end())
{
swap(arr[j],arr[j-1]);
}
else break;
}
}
}
for(int i = n-1;i>=1;i--)
if(vis[arr[i]]) ans++;
else break;
printf("%d\n",ans);
return 0;
}
题意 给你一个序列 两个操作 第一个是给第i个数+x 然后执行一段连续操作 若后面的数比前面的数+k[i]小 则把这个数更新成前面这个数+k【i】 第二个操作就是区间查询和
做法 一开始首先对这个式子 a[i] + k[i] < a[i+1]
->a[i] < a[i+1] - k [i]
->a[i] - k[1]-......-k[i-1] < a[i+1] - k[i] - k[1]-......-k[i-1]
设 t[i] = k[1] + k[2] + k[3] +... k[i-1]
那么只要对a[i] - k[i-1]建树
后来你可以二分(一开始想二分 没看到题目一句话 It's guaranteed that initially ai+ki≤ai+1ai+ki≤ai+1 for all 1≤i≤n−11≤i≤n−1.
典型的二分提示 那么你就可以二分这个需要区间替换的最右边值了 实际上他们都是一个差分后的数组 因为减去 k[l-1]
所以区间和的时候 答案为query(1,1,n,x,y) + ks[r-1] - ks[l-2](l>=2) 然后 update 一段更新为sum就是单点加加上的那个值即可
注意col数组初始化不能为0 因为你一开始可能有负的 加上一个值可能变成0 要初始化一个重来没出现过的值
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
const ll inf = 1e17;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 200025;
long long s[MAX_N<<2],k[MAX_N],ks[MAX_N],arr[MAX_N],col[MAX_N<<2];
void up(int rt)
{
s[rt] = s[rt<<1] + s[rt<<1|1];
}
void build(int rt,int l,int r)
{
col[rt] = inf;
if(l==r)
{
s[rt] = arr[l] - k [l-1];
return ;
}
int mid = (l+r)>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
up(rt);
}
void down(int rt,int l,int r)
{
if(col[rt]!=inf)
{
int mid = (l+r)>>1;
col[rt<<1] = col[rt];
col[rt<<1|1] = col[rt];
s[rt<<1] = col[rt]*(mid-l+1);
s[rt<<1|1] = col[rt]*(r-mid) ;
col[rt] = inf;
}
}
void update(int rt,int l,int r,int x,int y,long long v)
{
if(x<=l&&r<=y)
{
col[rt] = v;
s[rt] = col[rt]*(r-l+1);
return ;
}
int mid = (l+r)>>1;
down(rt,l,r);
if(x<=mid) update(rt<<1,l,mid,x,y,v);
if(mid<y) update(rt<<1|1,mid+1,r,x,y,v);
up(rt);
}
long long query(int rt,int l,int r,int x,int y)
{
if(x<=l&&r<=y)
{
return s[rt];
}
int mid = (l+r)>>1;
long long res = 0;
down(rt,l,r);
if(x<=mid) res+=query(rt<<1,l,mid,x,y);
if(mid<y) res+=query(rt<<1|1,mid+1,r,x,y);
return res;
}
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n,m,x,y;
char str[5];
scanf("%d",&n);
for(int i = 1;i<=n;++i) scanf("%lld",&arr[i]);
for(int i = 1;i<n;++i) scanf("%lld",&k[i]);
for(int i = 2;i<n;++i) k[i]+=k[i-1];
for(int i = 1;i<n;++i) ks[i] = ks[i-1] + k[i];
build(1,1,n);
scanf("%d",&m);
while(m--)
{
scanf("%s%d%d",str,&x,&y);
if(str[0]=='s')
{
printf("%lld\n",query(1,1,n,x,y)+ks[y-1]-(x>=2?ks[x-2]:0));
}
else
{
int l = 1,r = n,mid,ans_ = 1;
long long sum = query(1,1,n,x,x) + y;
while(l<=r)
{
mid = (l+r)>>1;
if(sum>query(1,1,n,mid,mid))
{
ans_ = mid;
l = mid + 1;
}
else r = mid - 1;
}
update(1,1,n,x,ans_,sum);
}
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
扫一扫
114
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
