2 条题解
-
1
import java.util.*; import java.io.*; public class Main{ //下面这个是一种更轻量化的输入方法 //用的内存和时间都更少 可以记一下 //老大网站上的题解我模仿着写会部分超时 static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); public static int nextInt() throws IOException{ in.nextToken(); return (int) in.nval; } public static void main(String [] args) throws IOException{ int n =nextInt(); int m =nextInt(); long [] a = new long [n+1]; long [] D = new long [n+2]; for(int i=1;i<=n;i++){ a[i]=1l*nextInt(); D[i]=a[i]-a[i-1]; } for(int i=1;i<=m;i++){ int l =nextInt(); int r =nextInt(); int d =nextInt(); D[l]+=d; D[r+1]-=d; } //将对差分数组的操作还原成对原数组的操作 for(int i=1;i<=n;i++){ D[i]=D[i]+D[i-1]; System.out.print(D[i]+" "); } } } -
0
蓝桥云课AC JAVA代码:
import java.util.*; import java.util.StringTokenizer; import java.io.*; public class Main { public static void main(String[] args) { int n=in.nextInt(); int m=in.nextInt(); int[] arr=new int[n+10];//原始数组 int[] b=new int[n+10];//差分数组 //数据读入 for(int i=1;i<=n;i++){ arr[i]=in.nextInt(); b[i]=arr[i]-arr[i-1]; } while(m-->0){ int l=in.nextInt(); int r=in.nextInt(); int d=in.nextInt(); b[l]+=d; b[r+1]-=d; } //还原数组 for(int i=1;i<=n;i++){ arr[i]=arr[i-1]+b[i]; out.print(arr[i]+" "); } out.close(); } static FastReader in=new FastReader(); static PrintWriter out=new PrintWriter(System.out); static class FastReader{ static BufferedReader br; static StringTokenizer st; FastReader(){ br=new BufferedReader(new InputStreamReader(System.in)); } String next() { String str=""; while(st==null||!st.hasMoreElements()) { try { str=br.readLine(); }catch(IOException e) { throw new RuntimeException(e); } st=new StringTokenizer(str); } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } double nextDouble() { return Double.parseDouble(next()); } long nextLong() { return Long.parseLong(next()); } } }
- 1
信息
- ID
- 22
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 2
- 标签
- 递交数
- 384
- 已通过
- 129
- 上传者