当前位置：首页 > news >正文

倒计时41天

news 来源：原创 2024/5/21 7:29:00

有趣的区间 (nowcoder.com)

//向前看，主要是这点，当时举例看奇数的时候就老看前还看后，其实后面的都会包括前面的#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+6;
const int inf=0x3f3f3f3f;
int a[N];
void solve()
{int x,n,cn=0;cin>>n;for(int i=1;i<=n;i++){cin>>x;if(x&1)cn+=i;}cout<<cn;
}
signed main()
{ios_base::sync_with_stdio(false);cin.tie(nullptr),cout.tie(nullptr);int t=1;//cin>>t;while(t--){solve();}return 0;
}

丛林木马 (nowcoder.com)

//™题目是10的10的5次方,看清题！！！
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+6;
const int inf=0x3f3f3f3f;
const int mod=998244353;
int a[N],b[N];
void solve()
{string s1,s2;cin>>s1>>s2;int x=0,y=0;for(int i=0;i<s1.size();i++){x*=10;x+=s1[i]-'0';x%=mod;}for(int i=0;i<s2.size();i++){y*=10;y+=s2[i]-'0';y%=mod;}cout<<(x*s2.size()+y*s1.size())%mod<<endl;
}
signed main()
{ios_base::sync_with_stdio(false);cin.tie(nullptr),cout.tie(nullptr);int t=1;cin>>t;while(t--){solve();}return 0;
}

深渊水妖 (nowcoder.com)

/*
//最开始的思路,,(0/100......(°ー°〃),,,),我不管,,,,我没错,,,,,,,,,(°ー°〃)
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 6;
const int inf = 0x3f3f3f3f;
struct node{int l,r,max1,zx,zy;
}no[N];
bool cmp(node a,node b)
{return a.max1>b.max1;
}
void solve() {int n,x,xx,k=0;cin>>n;for(int i=1;i<=n;i++){cin>>x;if(i==1||x<xx){k++;no[k].l=x;no[k].zx=i;//cout<<no[k].zx<<endl;}else {no[k].r=x;no[k].max1=no[k].r-no[k].l;no[k].zy=i;}xx=x;}sort(no+1,no+1+k,cmp);for(int i=1;i<=k;i++){cout<<no[i].zx<<' '<<no[i].zy<<' ';if(no[i].max1>no[i+1].max1)break;}cout<<endl;
}signed main() {ios_base::sync_with_stdio(false);cin.tie(nullptr), cout.tie(nullptr);int t = 1;cin>>t;while (t--) {solve();}return 0;
}
*/
//ac代码：
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 6;
const int inf = 0x3f3f3f3f;
struct node{int l,r,si;
}no[N];
int a[N];
void solve() {int n,max1=-inf,k=0,x=1;cin>>n;for(int i=1;i<=n;i++)cin>>a[i];for(int i=1;i<=n;i++){if(a[i]>a[i+1]||i==n){no[++k]={x,i,a[i]-a[x]};x=i+1;max1=max(max1,no[k].si);}}for(int i=1;i<=k;i++){if(max1==no[i].si){cout<<no[i].l<<' '<<no[i].r<<' ';}}cout<<endl;
}signed main() {ios_base::sync_with_stdio(false);cin.tie(nullptr), cout.tie(nullptr);int t = 1;cin>>t;while (t--) {solve();}return 0;
}