Commit31938ae

authored

Merge pull request#88 from technicalreju/main

Disk Space Analysis

2 parents8ba63a5 +dc1b9b1 commit31938aeCopy full SHA for 31938ae

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+#include<bits/stdc++.h>`
	`2`	`+usingnamespacestd;`
	`3`	`+vector<int> arr;`
	`4`	`+int prevmin=-1;`
	`5`	`+int flag=0;`
	`6`	`+int x,n,q;`
	`7`	`+`
	`8`	`+intsorting(int start,int end)`
	`9`	`+{`
	`10`	`+if(start+1==n) {start=0;end=end-n;}`
	`11`	`+if(start==end)return arr[start];`
	`12`	`+returnmin(arr[start],sorting(start+1,end));`
	`13`	`+}`
	`14`	`+`
	`15`	`+intfunc(int start,int end)`
	`16`	`+{`
	`17`	`+if(flag==0) {flag++;return prevmin=sorting(start,end);}`
	`18`	`+if(arr[start-1]==prevmin)return prevmin;`
	`19`	`+return prevmin=(arr[end]<=prevmin)?prevmin:sorting(start,end);`
	`20`	`+`
	`21`	`+}`
	`22`	`+`
	`23`	`+intmain()`
	`24`	`+{`
	`25`	`+ cin>>x>>n;`
	`26`	`+int ans=0;`
	`27`	`+for(int i=0;i<n;i++)`
	`28`	`+ {cin>>q;arr.push_back(q);}`
	`29`	`+for(int i=0;i<n;i++)`
	`30`	`+ {`
	`31`	`+ ans=max(ans,func(i,i+x-1));`
	`32`	`+ }`
	`33`	`+ cout<<ans;`
	`34`	`+}`

Comments

(0)