Submission #743624


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;

public class Main {
    FastScanner in = new FastScanner();
    PrintWriter out = new PrintWriter(System.out);

    private void solve() {
        int N = in.nextInt();
        int[] a = new int[N];
        for (int i = 0; i < N; i++) a[i] = in.nextInt();
        long ans = 1;
        int chain = 1;
        for (int i = 1; i < N; i++) {
            ans++;
            if (a[i - 1] < a[i]) {
                ans += chain;
                chain++;
            } else {
                chain = 1;
            }
        }
        out.println(ans);
    }

    private void run() {
        solve();
        out.flush();
    }

    public static void main(String[] args) {
        new Main().run();
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}

    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}

    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() { return Double.parseDouble(next());}
}

Submission Info

Submission Time
Task C - 単調増加
User ysd
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 3031 Byte
Status AC
Exec Time 227 ms
Memory 9528 KiB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 4
AC × 19
AC × 31
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 156 ms 7892 KiB
sample1.txt AC 156 ms 7764 KiB
sample2.txt AC 147 ms 7892 KiB
sample3.txt AC 145 ms 7888 KiB
subtask0_0.txt AC 169 ms 8276 KiB
subtask0_1.txt AC 154 ms 8148 KiB
subtask0_10.txt AC 153 ms 8148 KiB
subtask0_11.txt AC 160 ms 8148 KiB
subtask0_12.txt AC 162 ms 8340 KiB
subtask0_13.txt AC 149 ms 8148 KiB
subtask0_14.txt AC 164 ms 8148 KiB
subtask0_2.txt AC 160 ms 8148 KiB
subtask0_3.txt AC 152 ms 8276 KiB
subtask0_4.txt AC 151 ms 8276 KiB
subtask0_5.txt AC 147 ms 7892 KiB
subtask0_6.txt AC 148 ms 8020 KiB
subtask0_7.txt AC 169 ms 8148 KiB
subtask0_8.txt AC 160 ms 7892 KiB
subtask0_9.txt AC 170 ms 8016 KiB
subtask1_0.txt AC 193 ms 9396 KiB
subtask1_1.txt AC 227 ms 9144 KiB
subtask1_10.txt AC 198 ms 9272 KiB
subtask1_11.txt AC 189 ms 9524 KiB
subtask1_12.txt AC 196 ms 9492 KiB
subtask1_13.txt AC 200 ms 9400 KiB
subtask1_14.txt AC 186 ms 9364 KiB
subtask1_15.txt AC 189 ms 9448 KiB
subtask1_2.txt AC 169 ms 8852 KiB
subtask1_3.txt AC 190 ms 9396 KiB
subtask1_4.txt AC 187 ms 9400 KiB
subtask1_5.txt AC 186 ms 9300 KiB
subtask1_6.txt AC 172 ms 9172 KiB
subtask1_7.txt AC 184 ms 9528 KiB
subtask1_8.txt AC 173 ms 8900 KiB
subtask1_9.txt AC 163 ms 8272 KiB