Submission #2555309
Source Code Expand
#include <iostream> #include <algorithm> #include <set> #include <cstring> #include <string> #define N 100000 using namespace std; typedef unsigned long long llu; int price[N]; int profit[N]; int main(){ int last_min = 0; int min_cnt = 1; int max_cnt = 1; int last_pro = 0; int n,k; cin>>n>>k; k>>=1; for(int i = 0 ; i < n ; ++i){ cin>>price[i]; if(!i)last_min = price[i]; else{ if(last_min<price[i]){ last_min = price[i]; min_cnt = 1; } else if(last_min==price[i]){ ++min_cnt; } profit[i] = price[i]-last_min; } if(profit[i]==last_pro){ max_cnt++; } else if(profit[i]>last_pro){ profit[i] = last_pro; max_cnt = 1; } } cout<<min(max_cnt,min_cnt)<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - An Invisible Hand |
User | DevilInChina |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 942 Byte |
Status | WA |
Exec Time | 54 ms |
Memory | 1024 KB |
Judge Result
Set Name | sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | large_01.txt, large_02.txt, random_01.txt, random_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, small_01.txt, small_02.txt, spec_01.txt, spec_02.txt, spec_03.txt, spec_04.txt, spec_05.txt, spec_06.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
large_01.txt | WA | 53 ms | 1024 KB |
large_02.txt | AC | 36 ms | 1024 KB |
random_01.txt | AC | 53 ms | 1024 KB |
random_02.txt | AC | 54 ms | 1024 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
small_01.txt | AC | 1 ms | 256 KB |
small_02.txt | AC | 1 ms | 256 KB |
spec_01.txt | WA | 53 ms | 1024 KB |
spec_02.txt | WA | 54 ms | 1024 KB |
spec_03.txt | WA | 53 ms | 1024 KB |
spec_04.txt | WA | 54 ms | 1024 KB |
spec_05.txt | WA | 53 ms | 1024 KB |
spec_06.txt | WA | 54 ms | 1024 KB |