結果

問題 No.489 株に挑戦
ユーザー maimai
提出日時 2017-02-25 00:36:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,872 bytes
コンパイル時間 1,580 ms
コンパイル使用メモリ 175,852 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-11 00:12:48
合計ジャッジ時間 3,168 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 2 ms
5,376 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 35 ms
6,272 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 1 ms
5,376 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
    inlined from 'int main()' at main.cpp:121:64:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'bestj' may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:107:20: note: 'bestj' was declared here
  107 |     ll besti = -1, bestj;
      |                    ^~~~~

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFFLL
#define E107 1000000007ll
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
}

template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

template<typename T, T idt = 0x7FFFFFFF, typename Compare = std::less<T>>
class segtree {
    size_t size;
    vector<T> data;
    Compare cp;

    const T& selector(const T& x, const T& y) const {
        return cp(x, y) ? x : y;
    }
public:

    segtree(size_t n) {
        size = 1;
        while (size<n) size <<= 1;
        data.resize(size * 2);
    }

    void fill(const T& e) {
        std::fill(data.begin(), data.end(), e);
    }

    const T& operator[](size_t index) const {
        return data[size - 1 + index];
    }

    void update(size_t index, const T& e) {
        index += size - 1;
        data[index] = e;
        while (0 < index) {
            index = (index - 1) / 2; // 親へ移動
            data[index] = selector(data[index * 2 + 1], data[index * 2 + 2]); // iの子を参照して、d[i]を更新する
        }
    }

    T query(size_t begin, size_t end, size_t ptr = 0, size_t rangebegin = 0, size_t rangeend = 0) const {
        if (rangeend <= rangebegin) { rangeend = size; }
    
        if (rangeend <= begin || end <= rangebegin) return idt;
        if (begin <= rangebegin && rangeend <= end) return data[ptr];
    
        size_t rangemid = (rangebegin + rangeend) / 2;
        return selector(query(begin, end, ptr * 2 + 1, rangebegin, rangemid), query(begin, end, ptr * 2 + 2, rangemid, rangeend));
    }

};


int width, height;
ll n, dd, kk;

ll daikon[100010];

struct compare{
    bool operator ()(const ll& l, const ll& r) const {
        if (l == BIGINT) return false;
        if (r == BIGINT) return true;
        return daikon[l] < daikon[r];
    }
};

int main() {
    ll i, j, k, l;
    ll x, y, a, b;


    cin >> n >> dd >> kk;

    for (i = 0; i < n; ++i) {
        scanf("%lld", daikon + i);
    }

    segtree<int, BIGINT, compare> seg(n*2);
    seg.fill(BIGINT);

    ll best = 0;
    ll besti = -1, bestj;
    for (i = 0; i < n; ++i) {
        seg.update(i, i);
        ll les = seg.query(max(0ll, i - dd), i);
        if (les != BIGINT && best < daikon[i] - daikon[les]) {
            best = daikon[i] - daikon[les+1];
            besti = les+1;
            bestj = i;
        }
    }
    if (besti == -1 || best == 0) {
        cout << 0 << endl;
    }
    else {
        cout << (((ll)best)*(ll)kk) << endl << besti << ' ' << bestj << endl;
    }

    return 0;
}
0