Admin

1221 animes navigated

Why Everyone is Obsessed with the Rug Gripper Pads

Are you tired of dealing with...

curl-programming-lang 1.0.2

Introduction to curl-programming-lang 1.0.2 The open-source developer ecosystem continues to thrive with the introduction of...

Why Everyone is Obsessed with the Blind Spot Mirrors

Are you tired of dealing with...

Forex Broker F1Pro Review...

F1pro is one of the platforms that are furnishing...

Installing, Sealing and Protecting...

Marble flooring tiles by Marble suppliers in UAE can...

Aluminum: The Reason For...

Envision that you have a light, however solid metal,...

5 Effective Ways to...

High blood pressure or hypertension is widespread nowadays. Approximately...

Branding Isn’t All About...

Branding is not just a Logo A brand is not...

Pastor Chris Rhapsody Online...

Rhapsody Online Prayer Conference is one of the most...

Good Health Tips for...

Good health tips shouldn’t be taken as granted as...

Breast Actives Review ...

The Breast Actives Natural Bust Enhancement program does undoubtedly...

Codeforces Round #443 (Div....

#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int...

Codeforces Round #443 (Div....

#include <stdio.h> struct node { __int64 ans,num; }s; int main() { int n,k,m; while(~scanf("%d%d%d",&n,&k,&m)) { scanf("%I64d",&s.num); s.ans=1; int len=1; for(int i=1;i<n;i++) { int x; scanf("%d",&x); if(x==s.num) { s.ans++; if(s.ans==k) { s.ans=0; len--; } } else { s.num=x; s.ans=1; len++; } } int...

Codeforces Round #443 (Div....

#include <iostream> using namespace std; const int maxn = 5e5; int n,...

Codeforces Round #443 (Div....

#include <iostream> using namespace std; int main() { long long n,k,a,m=0,ab=0; cin>>n>>k>>ab; while(--n){ cin>>a; if(m==k){break;} if(ab>a){m++;} else ab=a,m=1; } cout<<ab; }