Merge pull request ashutosh97#114 from JanviMahajan14/algo-2

A phone price problem

Author: ashutosh97

Phone price/solution.cpp

@@ -0,0 +1,39 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;int a[n];
+
+        for(int i=0;i<n;i++){
+            cin>>a[i];
+        }
+
+        int j=1;int good =1;int cnt=0;int t=0;
+
+        for(int i=1;i<n;i++){
+                if(i>=6)t++;
+            for(j=i-1;j>=t;j--){
+
+                if(a[j]>a[i]){
+                cnt=1;}
+
+                else {
+                cnt=0;
+                break;}
+
+            }
+
+            if(cnt==1)
+            good++;
+
+        }
+
+        cout<<good<<endl;
+    }
+
+
+}

Phone price/statement.txt

@@ -0,0 +1,34 @@
+Chef wants to buy a new phone, but he is not willing to spend a lot of money. Instead, he checks the price of his chosen model everyday and waits for the price to drop to an acceptable value. So far, he has observed the price for N days (numbere 1 through N); for each valid i, the price on the i-th day was Pi dollars.
+
+On each day, Chef considers the price of the phone to be good if it is strictly smaller than all the prices he has observed during the previous five days. If there is no record of the price on some of the previous five days (because Chef has not started checking the price on that day yet), then Chef simply ignores that previous day ― we could say that he considers the price on that day to be infinite.
+
+Now, Chef is wondering ― on how many days has he considered the price to be good? Find the number of these days.
+
+Input
+The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
+The first line of each test case contains a single integer N.
+The second line contains N space-separated integers P1,P2,…,PN.
+
+Output
+For each test case, print a single line containing one integer ― the number of days with a good price.
+
+Constraints
+1≤T≤100
+7≤N≤100
+350≤Pi≤750 for each valid i
+
+Subtasks
+
+Subtask #1 (30 points): N=7
+Subtask #2 (70 points): original constraints
+
+Example Input
+1
+7
+375 750 723 662 647 656 619
+
+Example Output
+2
+
+Explanation
+Example case 1: Chef considers the price to be good on day 1, because he has not observed any prices on the previous days. The prices on days 2,3,4,5,6 are not considered good because they are greater than the price on day 1. Finally, the price on day 7 is considered good because it is smaller than all of the prices on days 2,3,4,5,6.