#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[2000005],tree[8000005],lazy[8000005];
void build(ll node,ll start,ll end){
if(start == end){
tree[node] = a[start];
return;
}
ll mid = (start+end)>>1;
build((node<<1)+1,start,mid);
build((node<<1)+2,mid+1,end);
tree[node] = min(tree[(node<<1)+1],tree[(node<<1)+2]);
}
void update(ll l,ll r,ll value,ll node,ll start,ll end){
if(r<start || end<l){
return;
}
if(lazy[node]){
tree[node]+=lazy[node];
tree[(node<<1)+1]+=lazy[node];
tree[(node<<1)+2]+=lazy[node];
lazy[node] = 0;
}
if(l<=start && end<=r){
tree[node]+=value;
lazy[(node<<1)+1]+=value;
lazy[(node<<1)+2]+=value;
return;
}
ll mid = (start+end)>>1;
update(l,r,value,(node<<1)+1,start,mid);
update(l,r,value,(node<<1)+2,mid+1,end);
tree[node] = min(tree[(node<<1)+1],tree[(node<<1)+2]);
}
ll query(ll l,ll r,ll node,ll start,ll end){
if(r<start | end<l)
return 1e18;
if(lazy[node]){
tree[node]+=lazy[node];
tree[(node<<1)+1]+=lazy[node];
tree[(node<<1)+2]+=lazy[node];
lazy[node] = 0;
}
if(l<=start && end<=r)
return tree[node];
ll mid = (start+end)>>1;
return min(query(l,r,(node<<1)+1,start,mid),query(l,r,(node<<1)+2,mid+1,end));
}
int main(){
ll n,m,l,r,v;
char c;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
build(0,0,n-1);
memset(lazy,0,sizeof(lazy));
cin>>m;
while(m--){
cin>>l>>r;
scanf("%c",&c);
if(c == 10){
if(l<=r){
cout<<query(l,r,0,0,n-1)<<endl;
}
else
cout<<min(query(l,n-1,0,0,n-1),query(0,r,0,0,n-1))<<endl;
}
else{
cin>>v;
if(l<=r)
update(l,r,v,0,0,n-1);
else{
update(l,n-1,v,0,0,n-1);
update(0,r,v,0,0,n-1);
}
}
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsgCnR5cGVkZWYgbG9uZyBsb25nIGxsOwpsbCBhWzIwMDAwMDVdLHRyZWVbODAwMDAwNV0sbGF6eVs4MDAwMDA1XTsKdm9pZCBidWlsZChsbCBub2RlLGxsIHN0YXJ0LGxsIGVuZCl7CiAgICBpZihzdGFydCA9PSBlbmQpewogICAgICAgIHRyZWVbbm9kZV0gPSBhW3N0YXJ0XTsKICAgICAgICByZXR1cm47CiAgICB9CiAgICBsbCBtaWQgPSAoc3RhcnQrZW5kKT4+MTsKICAgIGJ1aWxkKChub2RlPDwxKSsxLHN0YXJ0LG1pZCk7CiAgICBidWlsZCgobm9kZTw8MSkrMixtaWQrMSxlbmQpOwogICAgdHJlZVtub2RlXSA9IG1pbih0cmVlWyhub2RlPDwxKSsxXSx0cmVlWyhub2RlPDwxKSsyXSk7Cn0Kdm9pZCB1cGRhdGUobGwgbCxsbCByLGxsIHZhbHVlLGxsIG5vZGUsbGwgc3RhcnQsbGwgZW5kKXsKICAgIGlmKHI8c3RhcnQgfHwgZW5kPGwpewogICAgICAgIHJldHVybjsKICAgIH0KICAgIGlmKGxhenlbbm9kZV0pewogICAgICAgIHRyZWVbbm9kZV0rPWxhenlbbm9kZV07CiAgICAgICAgdHJlZVsobm9kZTw8MSkrMV0rPWxhenlbbm9kZV07CiAgICAgICAgdHJlZVsobm9kZTw8MSkrMl0rPWxhenlbbm9kZV07CiAgICAgICAgbGF6eVtub2RlXSA9IDA7CiAgICB9CiAgICBpZihsPD1zdGFydCAmJiBlbmQ8PXIpewogICAgICAgIHRyZWVbbm9kZV0rPXZhbHVlOwogICAgICAgIGxhenlbKG5vZGU8PDEpKzFdKz12YWx1ZTsKICAgICAgICBsYXp5Wyhub2RlPDwxKSsyXSs9dmFsdWU7CiAgICAgICAgcmV0dXJuOwogICAgfQogICAgbGwgbWlkID0gKHN0YXJ0K2VuZCk+PjE7CiAgICB1cGRhdGUobCxyLHZhbHVlLChub2RlPDwxKSsxLHN0YXJ0LG1pZCk7CiAgICB1cGRhdGUobCxyLHZhbHVlLChub2RlPDwxKSsyLG1pZCsxLGVuZCk7CiAgICB0cmVlW25vZGVdID0gbWluKHRyZWVbKG5vZGU8PDEpKzFdLHRyZWVbKG5vZGU8PDEpKzJdKTsKfSAgICAKbGwgcXVlcnkobGwgbCxsbCByLGxsIG5vZGUsbGwgc3RhcnQsbGwgZW5kKXsKICAgIGlmKHI8c3RhcnQgfCBlbmQ8bCkKICAgICAgICByZXR1cm4gMWUxODsKICAgIGlmKGxhenlbbm9kZV0pewogICAgICAgIHRyZWVbbm9kZV0rPWxhenlbbm9kZV07CiAgICAgICAgdHJlZVsobm9kZTw8MSkrMV0rPWxhenlbbm9kZV07CiAgICAgICAgdHJlZVsobm9kZTw8MSkrMl0rPWxhenlbbm9kZV07CiAgICAgICAgbGF6eVtub2RlXSA9IDA7CiAgICB9CiAgICBpZihsPD1zdGFydCAmJiBlbmQ8PXIpCiAgICAgICAgcmV0dXJuIHRyZWVbbm9kZV07CiAgICBsbCBtaWQgPSAoc3RhcnQrZW5kKT4+MTsKICAgIHJldHVybiBtaW4ocXVlcnkobCxyLChub2RlPDwxKSsxLHN0YXJ0LG1pZCkscXVlcnkobCxyLChub2RlPDwxKSsyLG1pZCsxLGVuZCkpOwp9CmludCBtYWluKCl7CiAgICBsbCBuLG0sbCxyLHY7CiAgICBjaGFyIGM7CiAgICBjaW4+Pm47CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKQogICAgICAgIGNpbj4+YVtpXTsKICAgIGJ1aWxkKDAsMCxuLTEpOwogICAgbWVtc2V0KGxhenksMCxzaXplb2YobGF6eSkpOwogICAgY2luPj5tOwogICAgd2hpbGUobS0tKXsKICAgICAgICBjaW4+Pmw+PnI7CiAgICAgICAgc2NhbmYoIiVjIiwmYyk7CiAgICAgICAgaWYoYyA9PSAxMCl7CiAgICAgICAgICAgIGlmKGw8PXIpewogICAgICAgICAgICAgICAgY291dDw8cXVlcnkobCxyLDAsMCxuLTEpPDxlbmRsOwogICAgICAgICAgICB9CiAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgIGNvdXQ8PG1pbihxdWVyeShsLG4tMSwwLDAsbi0xKSxxdWVyeSgwLHIsMCwwLG4tMSkpPDxlbmRsOwogICAgICAgIH0KICAgICAgICBlbHNlewogICAgICAgICAgICBjaW4+PnY7CiAgICAgICAgICAgIGlmKGw8PXIpCiAgICAgICAgICAgICAgICB1cGRhdGUobCxyLHYsMCwwLG4tMSk7CiAgICAgICAgICAgIGVsc2V7CiAgICAgICAgICAgICAgICB1cGRhdGUobCxuLTEsdiwwLDAsbi0xKTsKICAgICAgICAgICAgICAgIHVwZGF0ZSgwLHIsdiwwLDAsbi0xKTsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KfQ==
Main.java:1: error: illegal character: '#'
#include<bits/stdc++.h>
^
Main.java:1: error: class, interface, or enum expected
#include<bits/stdc++.h>
^
Main.java:3: error: class, interface, or enum expected
typedef long long ll;
^
Main.java:4: error: class, interface, or enum expected
ll a[2000005],tree[8000005],lazy[8000005];
^
Main.java:5: error: class, interface, or enum expected
void build(ll node,ll start,ll end){
^
Main.java:8: error: class, interface, or enum expected
return;
^
Main.java:9: error: class, interface, or enum expected
}
^
Main.java:11: error: class, interface, or enum expected
build((node<<1)+1,start,mid);
^
Main.java:12: error: class, interface, or enum expected
build((node<<1)+2,mid+1,end);
^
Main.java:13: error: class, interface, or enum expected
tree[node] = min(tree[(node<<1)+1],tree[(node<<1)+2]);
^
Main.java:14: error: class, interface, or enum expected
}
^
Main.java:18: error: class, interface, or enum expected
}
^
Main.java:21: error: class, interface, or enum expected
tree[(node<<1)+1]+=lazy[node];
^
Main.java:22: error: class, interface, or enum expected
tree[(node<<1)+2]+=lazy[node];
^
Main.java:23: error: class, interface, or enum expected
lazy[node] = 0;
^
Main.java:24: error: class, interface, or enum expected
}
^
Main.java:27: error: class, interface, or enum expected
lazy[(node<<1)+1]+=value;
^
Main.java:28: error: class, interface, or enum expected
lazy[(node<<1)+2]+=value;
^
Main.java:29: error: class, interface, or enum expected
return;
^
Main.java:30: error: class, interface, or enum expected
}
^
Main.java:32: error: class, interface, or enum expected
update(l,r,value,(node<<1)+1,start,mid);
^
Main.java:33: error: class, interface, or enum expected
update(l,r,value,(node<<1)+2,mid+1,end);
^
Main.java:34: error: class, interface, or enum expected
tree[node] = min(tree[(node<<1)+1],tree[(node<<1)+2]);
^
Main.java:35: error: class, interface, or enum expected
}
^
Main.java:39: error: class, interface, or enum expected
if(lazy[node]){
^
Main.java:41: error: class, interface, or enum expected
tree[(node<<1)+1]+=lazy[node];
^
Main.java:42: error: class, interface, or enum expected
tree[(node<<1)+2]+=lazy[node];
^
Main.java:43: error: class, interface, or enum expected
lazy[node] = 0;
^
Main.java:44: error: class, interface, or enum expected
}
^
Main.java:47: error: class, interface, or enum expected
ll mid = (start+end)>>1;
^
Main.java:48: error: class, interface, or enum expected
return min(query(l,r,(node<<1)+1,start,mid),query(l,r,(node<<1)+2,mid+1,end));
^
Main.java:49: error: class, interface, or enum expected
}
^
Main.java:52: error: class, interface, or enum expected
char c;
^
Main.java:53: error: class, interface, or enum expected
cin>>n;
^
Main.java:54: error: class, interface, or enum expected
for(int i=0;i<n;i++)
^
Main.java:54: error: class, interface, or enum expected
for(int i=0;i<n;i++)
^
Main.java:54: error: class, interface, or enum expected
for(int i=0;i<n;i++)
^
Main.java:56: error: class, interface, or enum expected
build(0,0,n-1);
^
Main.java:57: error: class, interface, or enum expected
memset(lazy,0,sizeof(lazy));
^
Main.java:58: error: class, interface, or enum expected
cin>>m;
^
Main.java:59: error: class, interface, or enum expected
while(m--){
^
Main.java:61: error: class, interface, or enum expected
scanf("%c",&c);
^
Main.java:62: error: class, interface, or enum expected
if(c == 10){
^
Main.java:65: error: class, interface, or enum expected
}
^
Main.java:68: error: class, interface, or enum expected
}
^
Main.java:71: error: class, interface, or enum expected
if(l<=r)
^
Main.java:73: error: class, interface, or enum expected
else{
^
Main.java:75: error: class, interface, or enum expected
update(0,r,v,0,0,n-1);
^
Main.java:76: error: class, interface, or enum expected
}
^
49 errors