結果

問題 No.489 株に挑戦
ユーザー phspls
提出日時 2022-12-30 23:49:50
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 44 ms / 1,000 ms
コード長 2,769 bytes
コンパイル時間 11,614 ms
コンパイル使用メモリ 375,556 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-25 22:10:39
合計ジャッジ時間 14,395 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:5:5
  |
3 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
4 |     n: usize,
5 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

warning: method `get` is never used
  --> src/main.rs:44:8
   |
11 | / impl<F, T> SegmentTree<F, T> where
12 | | T: std::fmt::Debug + Copy,
13 | | F: Fn(T, T) -> T
   | |________________- method in this implementation
...
44 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff #
プレゼンテーションモードにする

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
n: usize,
orgn: usize,
unit: T,
mem: Vec<T>,
operator: F
}
impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
fn new(n: usize, unit: T, operator: F) -> Self {
let mut size = 1usize;
while size < n { size *= 2; }
Self {
n: size,
orgn: n,
unit: unit,
mem: vec![unit; size*2-1],
operator: operator,
}
}
fn find_closed(&self, l: usize, r: usize) -> T {
self.find(l, r+1)
}
fn find(&self, l: usize, r: usize) -> T {
self._find(l, r, 0, 0, self.n)
}
fn set(&mut self, pos: usize, val: T) {
let mut pos = pos + self.n - 1;
self.mem[pos] = val;
while pos > 0 {
pos = self._parent(pos);
self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
}
}
fn get(&mut self, pos: usize) -> T {
self.mem[pos + self.n - 1]
}
fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
if r <= a || b <= l {
return self.unit;
} else if a <= l && r <= b {
return self.mem[nodenum];
}
let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
(self.operator)(left, right)
}
fn _left(&self, k: usize) -> usize {
2*k+1
}
fn _right(&self, k: usize) -> usize {
2*k+2
}
fn _parent(&self, k: usize) -> usize {
(k-1)/2
}
}
fn main() {
let mut ndk = String::new();
std::io::stdin().read_line(&mut ndk).ok();
let ndk: Vec<usize> = ndk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
let n = ndk[0];
let d = ndk[1];
let k = ndk[2];
let x = (0..n).map(|_| {
let mut temp = String::new();
std::io::stdin().read_line(&mut temp).ok();
let temp: usize = temp.trim().parse().unwrap();
temp
})
.collect::<Vec<_>>();
let mut segtree = SegmentTree::new(n, 0, |x, y| x.max(y));
for i in 0..n {
segtree.set(i, x[i]);
}
let mut start = 0usize;
let mut result = 0usize;
for i in 0..n-1 {
let maxval = segtree.find_closed(i+1, i+d);
if maxval > x[i] && result < maxval - x[i] {
result = maxval - x[i];
start = i;
}
}
let result = result;
println!("{}", result * k);
if result > 0 {
let maxpoint = (start+1..=(start+d).min(n-1)).filter(|&i| x[i] == result + x[start]).nth(0).unwrap();
println!("{} {}", start, maxpoint);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0