Submission #636182


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(i=0;i<n;++i)
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define mp make_pair
#define pb push_back
#define fi first
#define sc second

int main(int argc, char const *argv[]) {
  int i,j;

  int n;
  cin >>n;

  //積み上げていく
  vector<int> v;

  rep(i,n){
    int w;
    scanf(" %d",&w);

    auto pos=lower_bound(v.begin(),v.end(),w);

    if(pos==v.end()) v.pb(w);
    else v[pos-v.begin()]=w;
    sort(v.begin(),v.end());
    /*
    rep(j,v.size()) printf(" %d", v[j]);
    printf("\n");
    */
  }

  std::cout << v.size() << std::endl;
  return 0;
}

Submission Info

Submission Time
Task C - 積み重ね
User imulan
Language C++11 (GCC 4.8.1)
Score 100
Code Size 728 Byte
Status AC
Exec Time 29 ms
Memory 1096 KB

Compile Error

./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:23:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %d",&w);
                    ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 44
Set Name Test Cases
All 00_min.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 02_maxrnd_00.txt, 02_maxrnd_01.txt, 02_maxrnd_02.txt, 02_maxrnd_03.txt, 02_maxrnd_04.txt, 02_maxrnd_05.txt, 02_maxrnd_06.txt, 02_maxrnd_07.txt, 02_maxrnd_08.txt, 02_maxrnd_09.txt, 02_maxrnd_10.txt, 02_maxrnd_11.txt, 02_maxrnd_12.txt, 02_maxrnd_13.txt, 02_maxrnd_14.txt, 02_maxrnd_15.txt, 02_maxrnd_16.txt, 02_maxrnd_17.txt, 02_maxrnd_18.txt, 02_maxrnd_19.txt, 03_increase_00.txt, 03_increase_01.txt, 03_increase_02.txt, 04_decrease_00.txt, 04_decrease_01.txt, 04_decrease_02.txt, 05_same_00.txt, 05_same_01.txt
Case Name Status Exec Time Memory
00_min.txt AC 29 ms 924 KB
00_sample_01.txt AC 27 ms 1052 KB
00_sample_02.txt AC 26 ms 952 KB
00_sample_03.txt AC 26 ms 1048 KB
00_sample_04.txt AC 28 ms 948 KB
00_sample_05.txt AC 27 ms 952 KB
01_rnd_00.txt AC 27 ms 956 KB
01_rnd_01.txt AC 28 ms 1028 KB
01_rnd_02.txt AC 25 ms 956 KB
01_rnd_03.txt AC 27 ms 956 KB
01_rnd_04.txt AC 28 ms 1044 KB
01_rnd_05.txt AC 27 ms 1052 KB
01_rnd_06.txt AC 25 ms 896 KB
01_rnd_07.txt AC 27 ms 1044 KB
01_rnd_08.txt AC 27 ms 1052 KB
01_rnd_09.txt AC 26 ms 1052 KB
02_maxrnd_00.txt AC 27 ms 956 KB
02_maxrnd_01.txt AC 27 ms 1052 KB
02_maxrnd_02.txt AC 27 ms 1048 KB
02_maxrnd_03.txt AC 27 ms 1044 KB
02_maxrnd_04.txt AC 26 ms 1052 KB
02_maxrnd_05.txt AC 26 ms 1044 KB
02_maxrnd_06.txt AC 27 ms 1048 KB
02_maxrnd_07.txt AC 27 ms 1052 KB
02_maxrnd_08.txt AC 26 ms 1048 KB
02_maxrnd_09.txt AC 26 ms 1056 KB
02_maxrnd_10.txt AC 26 ms 1044 KB
02_maxrnd_11.txt AC 25 ms 1056 KB
02_maxrnd_12.txt AC 26 ms 1048 KB
02_maxrnd_13.txt AC 27 ms 1048 KB
02_maxrnd_14.txt AC 26 ms 1044 KB
02_maxrnd_15.txt AC 27 ms 956 KB
02_maxrnd_16.txt AC 28 ms 900 KB
02_maxrnd_17.txt AC 27 ms 1048 KB
02_maxrnd_18.txt AC 27 ms 952 KB
02_maxrnd_19.txt AC 27 ms 1052 KB
03_increase_00.txt AC 27 ms 928 KB
03_increase_01.txt AC 27 ms 1048 KB
03_increase_02.txt AC 27 ms 952 KB
04_decrease_00.txt AC 28 ms 924 KB
04_decrease_01.txt AC 27 ms 952 KB
04_decrease_02.txt AC 27 ms 1052 KB
05_same_00.txt AC 27 ms 1096 KB
05_same_01.txt AC 27 ms 1056 KB