Wrong Answer
Code
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll n,k,x;
cin>>n>>k>>x;
vector<ll>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
ll mx=-1,id=-1,f=1,c_z=0,s=0;
for(int i=0;i<k;i++)
{
if(v[i]==0)
{
c_z++;
}
if(v[i]!=0)
{
f*=v[i];
}
s+=v[i];
}
if(s%x==0)
{
ll d=f;
if(c_z>0)
{
d=0;
}
if(d>mx)
{
mx=d;
id=1;
}
}
ll ft=0,dt=1;
for(int i=k;i<n;i++)
{
s-=v[ft];
if(v[ft]!=0)
{
dt*=v[ft];
f/=dt;
}
if(v[ft]==0)
c_z--;
ft++;
s+=v[i];
if(v[i]==0)
c_z++;
if(v[i]!=0)
f*=v[i];
if(s%x==0)
{
ll d=f;
if(c_z>0)
{
d=0;
}
if(d>mx)
{
mx=f;
id=((i+1)-k)+1;
}
}
}
cout<<id<<endl;
}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1190 Segment Strength
- Contest
- Brain Booster #9
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-04-06 16:21:47
- Judged At
- 2025-04-06 16:21:47
- Judged By
- Score
- 80
- Total Time
- 36ms
- Peak Memory
- 2.066 MiB